Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ACM-ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

E. Fools and Roads

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputThey say that Berland has exactly two problems, fools and roads. Besides, Berland has *n* cities, populated by the fools and connected by the roads. All Berland roads are bidirectional. As there are many fools in Berland, between each pair of cities there is a path (or else the fools would get upset). Also, between each pair of cities there is no more than one simple path (or else the fools would get lost).

But that is not the end of Berland's special features. In this country fools sometimes visit each other and thus spoil the roads. The fools aren't very smart, so they always use only the simple paths.

A simple path is the path which goes through every Berland city not more than once.

The Berland government knows the paths which the fools use. Help the government count for each road, how many distinct fools can go on it.

Note how the fools' paths are given in the input.

Input

The first line contains a single integer *n* (2 ≤ *n* ≤ 10^{5}) — the number of cities.

Each of the next *n* - 1 lines contains two space-separated integers *u*_{i}, *v*_{i} (1 ≤ *u*_{i}, *v*_{i} ≤ *n*, *u*_{i} ≠ *v*_{i}), that means that there is a road connecting cities *u*_{i} and *v*_{i}.

The next line contains integer *k* (0 ≤ *k* ≤ 10^{5}) — the number of pairs of fools who visit each other.

Next *k* lines contain two space-separated numbers. The *i*-th line (*i* > 0) contains numbers *a*_{i}, *b*_{i} (1 ≤ *a*_{i}, *b*_{i} ≤ *n*). That means that the fool number 2*i* - 1 lives in city *a*_{i} and visits the fool number 2*i*, who lives in city *b*_{i}. The given pairs describe simple paths, because between every pair of cities there is only one simple path.

Output

Print *n* - 1 integer. The integers should be separated by spaces. The *i*-th number should equal the number of fools who can go on the *i*-th road. The roads are numbered starting from one in the order, in which they occur in the input.

Examples

Input

5

1 2

1 3

2 4

2 5

2

1 4

3 5

Output

2 1 1 1

Input

5

3 4

4 5

1 4

2 4

3

2 3

1 3

3 5

Output

3 1 1 1

Note

In the first sample the fool number one goes on the first and third road and the fool number 3 goes on the second, first and fourth ones.

In the second sample, the fools number 1, 3 and 5 go on the first road, the fool number 5 will go on the second road, on the third road goes the fool number 3, and on the fourth one goes fool number 1.

Codeforces (c) Copyright 2010-2017 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Aug/16/2017 22:21:45 (c3).

Desktop version, switch to mobile version.

User lists

Name |
---|