**Problem Description**

There are N areas in the ACM(Ancient Country of Magic).

There is an ancient subway system in the ACM. There are N-1 tracks, and track i connects directly between two different regions, u

_{i}and v

_{i}. all regions are connected by these tracks.

There are M subway routes, some of them may be the same. subway i goes back and forth between a

_{i}and b

_{i}, runs on the shortest path between them, and allows passengers to get on and off in each stop between a

_{i}and b

_{i}(including a

_{i}and b

_{i}).

As a beautiful country, there are many tourists visiting the country on the annual national day. However, these newcomers will not use satellite navigation, and can only turn to volunteer Lijiang. This time, Q tourists came to ask Lijiang.

The ith visitors will ask Lijiang whether the area p

_{i}and q

_{i}are the two stations on a certain subway line. If it is not answer 0, if so, answer there are how many such subway lines.

However, Lijiang is a road fool. If there is one mistake, the volunteer scores will be gone. Please help Lijiang so that she can answer all the questions correctly.

**Input**

The first line of data is a positive integer number T, which indicates that there are T test cases.

In each set of data: the first line are three integers N, M, Q, representing N areas of ACM, M subway lines in ACM, and Q tourists asking for directions to Lijiang.

Next, N-1 lines, each row has 2 numbers u

_{i}and v

_{i}, representing a track between u

_{i}and v

_{i}.

Next, M lines, each row of 2 figures a

_{i}and b

_{i}, represents a subway line between a

_{i}and b

_{i}.

Next, Q rows, each row of 2 figures p

_{i}and q

_{i}, represents tourists asking about area p

_{i}and q

_{i}.

It is guaranteed：

**Output**

For each query output an integer representing the answer.

**Sample Input**

1 4 2 3 1 2 2 3 1 4 2 4 1 3 1 3 1 2 3 4

**Sample Output**

1 2 0

**Hint**

here is the map of the ACM.

there are two subway lines 1<->2<->3 and 2<->1<->4

from 1 to 3, you can take subway green

from 1 to 2, you can take subway green and red

neither subway green nor subway red can take you from 3 to 4.

**Source**

2018市赛