Time Limit: 2000/1000 MS (Java/Others)

Memory Limit: 32768/32768 K (Java/Others)

The structure of the computer room in Northeastern University is pretty miraculous. There are $n$ servers, some servers connect to the gateway whose IP address is 0 directly. All servers are connected with each other by $n$ netting twines. It is said that this structure is favorable for maintaining physical problem of servers.

But because of an unexpected rainstorm, the computer room was destroyed by a terrible thunderclap!

Our maintainer Bittersweet found that many servers were not able to be visited, so he hurried to the computer room to lookup the reason. After several hours, Bittersweet realized that some net gape of servers were broken by thunderclap. However, there were too many servers to find out all the broken net gapes quickly. So he came up with an idea to assess the damaged condition roughly. Bittersweet decided to turn on some servers and ping other servers randomly, then record the unsuccessful pairs of servers.

Now he need a program to analyze the record to confirm what is the $minimum$ number of servers whose net gape was destroyed by thunderclap. Can you help him to complete this work?

But because of an unexpected rainstorm, the computer room was destroyed by a terrible thunderclap!

Our maintainer Bittersweet found that many servers were not able to be visited, so he hurried to the computer room to lookup the reason. After several hours, Bittersweet realized that some net gape of servers were broken by thunderclap. However, there were too many servers to find out all the broken net gapes quickly. So he came up with an idea to assess the damaged condition roughly. Bittersweet decided to turn on some servers and ping other servers randomly, then record the unsuccessful pairs of servers.

Now he need a program to analyze the record to confirm what is the $minimum$ number of servers whose net gape was destroyed by thunderclap. Can you help him to complete this work?

There are at most 20 test cases.

In each test case, the first line is an integer $n$ ($3 \leq n \leq 10^4$), denoting the number of servers. The IP address of these servers is $1 \dots n$.

Then follows $n$ lines, each line contains two integers $u$ and $v$ ($0 \leq u, v \leq n$), denoting that the server whose IP address is $u$ is connected with the server whose IP address is $v$ by netting twine initially.

After those, there is one line contains only an integer $p$ ($p \leq 50000$), denoting the number that Bittersweet uses ping.

Then follows $p$ lines, each line contains two integers $U$ and $V$ , denoting when using server $U$ to ping server $V$, it returned unsuccessful.

In each test case, the first line is an integer $n$ ($3 \leq n \leq 10^4$), denoting the number of servers. The IP address of these servers is $1 \dots n$.

Then follows $n$ lines, each line contains two integers $u$ and $v$ ($0 \leq u, v \leq n$), denoting that the server whose IP address is $u$ is connected with the server whose IP address is $v$ by netting twine initially.

After those, there is one line contains only an integer $p$ ($p \leq 50000$), denoting the number that Bittersweet uses ping.

Then follows $p$ lines, each line contains two integers $U$ and $V$ , denoting when using server $U$ to ping server $V$, it returned unsuccessful.

提交代码