Description

In the Republic of JOI, there are $N$ cities numbered from 1 to $N$. The cities are connected with $N-1$ roads. People in the Republic of JOI are travelling between cities using these roads. They can pass each of the roads in both directions. They can travel between any two cities by passing through one or several roads.

Mr. IOI is a candidate for the president of the Republic of JOI. Of course, to become the president, he must perform the campaign for the presidential election. His secretary made $M$ plans for the election campaign. In the $i$-th plan, Mr. IOI will travel from the city $A_i$ to the city $B_i$ passing through minimum number of roads, and make a public speech in each of the cities on the way (including the city $A_i$ and the city $B_i$). Because his secretary is brilliant, it is known that Mr. IOI will get $C_i$ votes if the $i$-th plan is performed. It is possible to perform several plans.

However, people in the Republic of JOI are impatient. If Mr. IOI makes public speeches more than once in the same city, he will lose the support from people in the Republic of JOI.

Because Mr. IOI would like to become the president, he wants to get as many votes as possible. Since you are a superprogrammer in the Republic of JOI, he asked you to write a program which calculates the maximum number of votes Mr. IOI can get in the presidential election under the assumption that he will not make public speeches more than once in the same city.

Task

Given the number $N$ of cities in the Republic of JOI, the information on the roads, the number $M$ of plans for the election campaign, and information of each plan, write a program which calculates the maximum number of votes Mr. IOI can get in the presidential election.

Input Format

Read the following data from the standard input.

• The first line of input contains an integer $N$, the number of cities in the Republic of JOI.
• The $i$-th line ($1 \leq i \leq N-1$) of the following $N-1$ lines contains two space separated integers $X_i, Y_i$. This means the $i$-th road connects the city $X_i$ and the city $Y_i$.
• The following one line contains an integer $M$, the number of plans for the election campaign.
• The $i$-th line ($1 \leq i \leq M$) of the following $M$ lines contains three space separated integers $A_i, B_i, C_i$. This means, in the $i$-th plan, Mr. IOI will travel from the city $A_i$ to the city $B_i$ passing through minimum number of roads, and he will get $C_i$ votes if this plan is performed.

Output Format

The output should consist of one line, and contain one integer which denotes the maximum number of votes Mr. IOI can get in the presidential election.

7
3 4
6 5
2 7
1 5
7 5
4 5
5
4 3 10
5 6 5
2 6 9
7 2 2
1 3 8

19

8
1 2
2 3
3 4
4 5
5 6
6 7
7 8
5
7 5 4
5 8 9
4 3 9
1 3 3
2 8 11

18

10
10 6
2 7
1 9
9 8
3 8
6 4
7 8
5 4
4 8
7
1 3 1
4 10 1
2 8 1
5 3 1
3 7 1
8 5 1
1 9 1

3

20
17 10
11 4
8 3
3 16
1 14
15 18
5 4
6 18
10 18
19 4
16 7
2 13
4 12
12 20
9 20
18 13
20 14
14 7
13 7
15
19 9 2341
13 8 6974
8 3 3339
15 17 6515
10 13 4370
1 7 8376
18 2 9272
6 7 4595
1 20 505
10 9 308
6 19 8937
2 15 5072
5 4 4217
2 4 4170
19 12 8204

29191

Hint

Sample 1 Explanation

In this sample input, the optimal strategy is to perform the plan 1 and the plan 3 for the election campaign.

Sample 2 Explanation

This sample input satisfies the constraints of the subtask 3.

Sample 3 Explanation

This sample input satisfies the constraints of the subtask 4.

Constraints

All input data satisfy the following conditions.

• $2 \leq N \leq 100\,000$.
• $1 \leq X_i \leq N$.
• $1 \leq Y_i \leq N$.
• $X_i \ne Y_i$ ($1 \leq i \leq N-1$).
• People can travel between any two cities by passing through one or several roads.
• $1 \leq M \leq 100\,000$.
• $1 \leq A_i \leq N$.
• $1 \leq B_i \leq N$.
• $A_i \ne B_i$ ($1 \leq i \leq M$).
• $1 \leq C_i \leq 10\,000$.

Subtask

Subtask 1 [10 points]

• $M \leq 15$.

Subtask 2 [5 points]

• $X_i = i$ ($1 \leq i \leq N-1$).
• $Y_i = i+1$ ($1 \leq i \leq N-1$).
• $C_i = 1$ ($1 \leq i \leq M$).

Subtask 3 [5 points]

• $X_i = i$ ($1 \leq i \leq N-1$).
• $Y_i = i+1$ ($1 \leq i \leq N-1$).

Subtask 4 [30 points]

• $C_i = 1$ ($1 \leq i \leq M$).

Subtask 5 [10 points]

• $N \leq 1\,000$.
• $M \leq 1\,000$.

Subtask 6 [40 points]

There are no additional constraints.