Vertices connected by the same color

You are given a tree with $N$ vertices. A tree is a connected undirected graph with no cycle. The vertices are numbered 1 to $N$ and the edges are numbered 1 to $N-1$. Every vertex is black at the start.

Two vertices $u$ and $v$ are connected when every vertex on the path from $u$ to $v$ has the same color. The path from $u$ to $u$ is a single vertex, so $u$ is always connected to itself.

Write a program that processes the following two queries.

• 1 i: change the color of vertex $i$. Black becomes white, white becomes black.
• 2 u: count the vertices $v$ that are connected to $u$. Count $u$ itself as well.

The first line contains the number of vertices $N$. ($2 \le N \le 100000$)

Each of the next $N-1$ lines contains the numbers $u$ and $v$ of the two vertices joined by an edge. ($1 \le u, v \le N$, $u \ne v$) The given edges form a tree.

The next line contains the number of queries $M$. ($1 \le M \le 100000$)

Each of the next $M$ lines contains one query. A query is either 1 i or 2 u, with $1 \le i, u \le N$.

For each query of type 2, print the answer on its own line, in the order the queries are given.