import io
import sys

_INPUT = """\
6
5
5 1
10 1
8 3
38 4
7
1 1
1 8
1 10
2 2
2 3
2 4
2 5
4
10 4
10 2
10 3
5
1 1
1 10
2 2
2 3
2 4
"""

def solve(test):
  import sys
  sys.setrecursionlimit(10**6)
  class UnionFind():
    def __init__(self, n):
      self.n = n
      self.parents = [-1] * n
    def find(self, x):
      if self.parents[x] < 0:
        return x
      else:
        self.parents[x] = self.find(self.parents[x])
        return self.parents[x]
    def union(self, x, y):
      x = self.find(x)
      y = self.find(y)
      if x == y:
        return
      if self.parents[x] > self.parents[y]:
        x, y = y, x
      self.parents[x] += self.parents[y]
      self.parents[y] = x
    def size(self, x):
      return -self.parents[self.find(x)]
    def same(self, x, y):
      return self.find(x) == self.find(y)
    def members(self, x):
      root = self.find(x)
      return [i for i in range(self.n) if self.find(i) == root]
    def roots(self):
      return [i for i, x in enumerate(self.parents) if x < 0]
    def group_count(self):
      return len(self.roots())
    def all_group_members(self):
      return {r: self.members(r) for r in self.roots()}
    def __str__(self):
      return '\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())

  N=int(input())
  W=[list(map(int,input().split())) for _ in range(N-1)]
  W=[(W[i][0],W[i][1]-1,i+1) for i in range(N-1)]
  Q=int(input())
  inf=10**20
  L=[-1]*N
  query=[list(map(int,input().split())) for _ in range(Q)]
  query1=[(query[i][1],inf,i) for i in range(Q) if query[i][0]==1]
  ans=[-1]*Q
  tmp=sorted(W+query1,key=lambda x: (x[0],x[1]))
  uf=UnionFind(N)
  for i in range(len(tmp)):
    l,t,idx=tmp[i]
    if t==10**20: ans[idx]=uf.size(0)
    else:
      # print(t)
      if uf.find(t)==uf.find(0) and uf.find(idx)!=uf.find(0):
        tt=uf.members(idx)
        for mem in tt:
          L[mem]=l
      if uf.find(idx)==uf.find(0) and uf.find(t)!=uf.find(0):
        tt=uf.members(t)
        for mem in tt:
          L[mem]=l
      uf.union(t,idx)
  for i in range(Q):
    d,y=query[i]
    if d==2:
      ans[i]=L[y-1]
  if test==0:
    print(*ans,sep='\n')
  else:
    return None

def random_input():
  from random import randint,shuffle
  N=randint(1,10)
  M=randint(1,N)
  A=list(range(1,M+1))+[randint(1,M) for _ in range(N-M)]
  shuffle(A)
  return (" ".join(map(str, [N,M]))+"\n"+" ".join(map(str, A))+"\n")*3

def simple_solve():
  return []

def main(test):
  if test==0:
    solve(0)
  elif test==1:
    sys.stdin = io.StringIO(_INPUT)
    case_no=int(input())
    for _ in range(case_no):
      solve(0)
  else:
    for i in range(1000):
      sys.stdin = io.StringIO(random_input())
      x=solve(1)
      y=simple_solve()
      if x!=y:
        print(i,x,y)
        print(*[line for line in sys.stdin],sep='')
        break

#0:提出用、1:与えられたテスト用、2:ストレステスト用
main(0)