JOI Open Contest

The JOI Co., Ltd. has $N$ servers in total around the world. Each server contains an important piece of information. Different servers contain different pieces of information. The JOI Co., Ltd. is now building digital lines between the servers so that the pieces of information will be shared with the servers. When a line is built between two servers, pieces of information can be exchanged between them. It is possible to exchange pieces of information from one server to another server which is reachable through the lines which are already built.

Each server has a high-performance synchronization system. When two servers can exchange pieces of information each other and they contain different pieces of information, they automatically synchronize the pieces of information. After a synchronization between the server A and the server B, both of the servers A and B will contain all the pieces of information which are contained in at least one of the servers A and B before the synchronization.

In order to reduce the cost, only $N-1$ lines can be built. After the $N-1$ lines are built, there will be a unique route to exchange pieces of information from one server to another server without passing through the same server more than once.

In the beginning (at time 0), no lines are built. Sometimes, lines are built in a harsh condition (e.g. in a desert, in the bottom of sea). Some of the lines become unavailable at some point. Once a line becomes unavailable, it is not possible to use it until it is rebuilt.

It is known that, at time $j$ $(1\le j\le M)$, the state of exactly one line is changed.

We need to know the number of different pieces of information contained in some of the servers at time $M+1$.

Task

Write a program which, given information of the lines to be built and the state of the lines, determine the number of different pieces of information contained in some of the servers.

Input Specification

Read the following data from the standard input.

• The first line of input contains three space separated integers $N$, $M$, $Q$. This means the number of the servers is $N$, a list of $M$ changes of the state of the lines is given, and we need to know the number of different pieces of information contained in $Q$ servers.
• The $i$-th line $(1\le i\le N-1)$ of the following $N-1$ lines contains space separated integers $X_i$, $Y_i$. This means the line $i$, when it is built, connects the server $X_i$ and the server $Y_i$.
• The $j$-th line $(1\le j\le M)$ of the following $M$ lines contains an integer $D_j$. This means the state of the line $D_j$ is changed at time $j$. Namely, if the line $D_j$ is unavailable just before time $j$, this line is built at time $j$. If the line $D_j$ is available just before time $j$, this line becomes unavailable at time $j$. When the state is changed at time $j$, all the synchronization processes will be finished before time $j+1$.
• The $k$-th line $(1\le k\le Q)$ of the following $Q$ lines contains an integer $C_k$. This means we need to know the number of different pieces of information contained in the server $C_k$ in the end.

Output Specification

Write $Q$ lines to the standard output. The $k$-th line $(1\le k\le Q)$ should contain an integer, the number of different pieces of information contained in the server $C_k$ in the end.

Constraints

All input data satisfy the following conditions.

• $2\le N\le 100000$.
• $1\le M\le 200000$.
• $1\le Q\le N$.
• $1\le X_i\le N$, $1\le Y_i\le N$, $X_i\ne Y_i$ $(1\le i\le N-1)$.
• $1\le D_j\le N-1$ $(1\le j\le M)$.
• $1\le C_k\le N$ $(1\le k\le Q)$.
• The values of $C_k$ are distinct.
• If all of the lines are built, there will be a route from one server to another server through the lines.

Subtasks

Subtask 1 [30 points]

• $Q=1$ is satisfied.

Subtask 2 [30 points]

• $X_i=i$, $Y_i=i+1$ $(1\le i\le N-1)$ are satisfied.

Subtask 3 [40 points]

No additional constraints.

Sample Input

5 6 3
1 2
1 3
2 4
2 5
1
2
1
4
4
3
1
4
5

Sample Output

3
5
4

Explanation for Sample

In the beginning, we assume the server $i$ $(1\le i\le 5)$ contains the piece $i$ of information.

• At time 1, the line 1 is built and the servers 1, 2 become connected. Then, both of the servers 1, 2 contain the pieces 1, 2 of information.
• At time 2, the line 2 is built, and the server 1, 3 become connected. Including the line 1, the servers 1, 2, 3 are connected. The servers 1, 2, 3 contain the pieces 1, 2, 3 of information.
• At time 3, the line 1 becomes unavailable because it was available just before this moment.
• At time 4, the line 4 is built and the servers 2, 5 become connected. Both of the servers 2, 5 contain the pieces 1, 2, 3, 5 of information. Note that the servers 1, 2 can not exchange pieces of information each other because the line 1 became unavailable.
• At time 5, the line 4 becomes unavailable.
• At time 6, the line 3 is built and the servers 2, 4 become connected. Then, both of the servers 2, 4 contain the pieces 1, 2, 3, 4, 5 of information.

As explained above, in the end, the servers 1, 4, 5 have 3, 5, 4 different pieces of information, respectively.