In The City of Eternal Festivities, there are $n$ street junctions and $n - 1$ bidirectional streets, each street connecting two of the junctions. Between every two junctions, there is exactly one (direct or indirect) path connecting them. No junction is an endpoint for more than $10$ streets.

Every 13th of September (the 256th day of the year), there are many festivities going on in The City. In particular, the citizens want to organize $m$ parades. The parade number $i$ starts at junction $u_ i$ and ends at $v_ i$, following the unique path between the endpoints.

As the mayor of The City, you are responsible for citizens’ safety. Therefore you decreed that no two parades are ever allowed to use the same street, though they can have common junctions, or even common endpoints.

To appease your citizens, try to organize as many parades as possible, without breaking the safety regulations.


The first line of input contains the number of test cases $T$ ($1 \leq T \leq 5$). The descriptions of the test cases follow:

The first line of each test case contains a single integer: the number of junctions $n$ ($2 \leq n \leq 1\, 000$). Each of the next $n - 1$ lines contains two integers $a$, $b$ ($1 \leq a \neq b \leq n$), denoting that junctions $a$ and $b$ are connected by a street. Each junction has at most $10$ streets leaving it.

The next line contains a single integer: the number of planned parades $m$, $0 \leq m \leq \binom {n}{2}$. Each of the next $m$ lines contains two integers $u_ i$, $v_ i$ ($1 \leq u_ i \neq v_ i \leq n$), meaning that a parade is planned to start at junction $u_ i$, and finish at junction $v_ i$. No two parades share both endpoints.


For each test case, output one line containing the largest number of parades that can be organized with no street used by more than one parade.

Sample Input 1 Sample Output 1
1 2
2 3
3 4
3 5
3 6
1 3
4 5
5 6
6 4
CPU Time limit 3 seconds
Memory limit 1024 MB
Difficulty 8.8hard
Statistics Show
License For educational use only

Please log in to submit a solution to this problem

Log in