Ants

You are given a tree with vertices numbered from $1$ to $n$. There are ants in the vertices of the tree. Initially, at each vertex $i$, there is one ant having index $i$.

You will be given $q$ queries. Each query $j$ contains an index $a_j$ of an ant that needs help. During query $j$, each ant goes to an adjacent vertex that is closest to ant $a_j$, or does not move if it is located at the same vertex as ant $a_j$. After each query, print the total number of pairs of ants that are located at the same vertex.

The changes persist between queries. For example, when the ants have to move to ant $a_2$, they are already in the positions reached after moving to ant $a_1$. Each query requires moving to ant $a_j$, which was at vertex $a_j$ initially but can be in some other vertex at the time of the query.

The first line of input contains an integer $n$, the size of the tree ($2 \le n \le 10^5$).

Each of the next $n - 1$ lines contains two integers $u$ and $v$ describing an edge of the tree ($1 \le u, v \le n$). It is guaranteed that the edges form a tree.

The next line contains an integer $q$, the number of queries ($1 \le q \le 10^5$).

The next $q$ lines contain integers $a_1, a_2, \ldots, a_q$, one per line: the numbers of ants in the queries ($1 \le a_j \le n$).

For each query, print a single line with the answer to it: the number of pairs of ants that are located at the same vertex after this query.