Yonsei University Point Game

Yeondori is in his second year, and he is in charge of the campus point game for the new students' orientation. In a point game, players walk to facilities all over campus and finish a mission at each spot, which is how they learn where everything is. The usual format sends a player from one spot to the next and never back. Yeondori played last year and found that he barely memorized a single location that way.

So he wrote new rules.

The game runs over $N$ spots on campus, numbered $0$ through $N-1$. The $N$ spots are joined by $N-1$ roads that form a tree. Every road is bidirectional, there is no cycle, and every spot is reachable from every other spot. Roads can have different lengths. The distance between two spots is the total length of the roads on the unique path between them.

A player performs $Q$ missions in the order they are given. There are two kinds of mission.

1. Visit spot $A$ and paint a blue locker there. If that spot is already painted, nothing changes.
2. Compute the sum of the distances from spot $A$ to every spot whose locker is painted blue.

No spot is painted when the game starts. If a mission of the second kind comes while no locker is painted, its answer is $0$.

Yeondori cannot work out the answers to the second kind of mission. Compute them for him.

The first line contains the number of spots $N$ ($1 \le N \le 100000$).

Each of the next $N-1$ lines, the $i$-th of them for $1 \le i \le N-1$, contains two integers $A_i$ and $B_i$ ($0 \le A_i < i$, $1 \le B_i \le 100$). Spot $i$ and spot $A_i$ are joined by a road of length $B_i$.

The next line contains the number of missions $Q$ ($1 \le Q \le 100000$).

Each of the next $Q$ lines contains two integers $C_i$ and $D_i$ ($C_i$ is $1$ or $2$, $0 \le D_i < N$), written in the order the missions are performed. If $C_i$ is $1$, paint a blue locker at spot $D_i$. If $C_i$ is $2$, find the sum of the distances from spot $D_i$ to every painted spot.

For each mission with $C_i = 2$, print the sum of the distances on its own line, in the order the missions are given.