import bisect
N=int(input())
lis=[]
for i in range(N-1):
    L,A=map(int,input().split())
    lis.append([L,A,i+2])
lis.sort()
use=[False for _ in range(N+2)]
sets=[set() for _ in range(N+2)]
use[1]=True
nums=[-1 for _ in range(N+2)]
count=[0 for _ in range(N+2)]
from collections import deque
for l,a,ind in lis:
    if use[a]:
        i=ind-2
        use[ind]=True
        nums[ind]=l
        dq=deque()
        dq.append(ind)
        while len(dq)!=0:
            p=dq.popleft()
            for s in sets[p]:
                use[s]=True
                nums[s]=l
                dq.append(s)
    else:
        sets[a].add(ind)

import bisect
point=[0 for _ in range(len(lis)+1)]
for i in range(2,N+1):
    if nums[i]!=-1:
        point[bisect.bisect_left(lis,[nums[i]])]+=1
for i in range(1,len(point)):
    point[i]+=point[i-1]
point.append(0)
for i in range(len(point)):
    point[i]+=1
Q=int(input())
for _ in range(Q):
    q=list(map(int,input().split()))
    if q[0]==2:
        print(nums[q[1]])
    if q[0]==1:
        print(point[bisect.bisect_right(lis,[q[1],10**9])-1])
        pass