from collections import *
from itertools import *
from functools import *
from heapq import *
import sys,math
sys.setrecursionlimit(3*10**5)
input = sys.stdin.readline

N = int(input())
e = [[] for _ in range(N)]
INF = (1<<60)
val = [INF]*N
val[0] = 0
for i in range(N-1):
    l,a = map(int,input().split())
    a -= 1
    e[i+1].append((a,l))
def cle(a,D):
    
    y = len(D)-1
    x = 0
    if D[x]>a:
        return 0
        
    if D[y]<=a:
        return y+1
    
    while y-x>1:
        mid = (y+x)//2
        if D[mid]<=a:
            x = mid
        else:
            y = mid
    return y
cnt = 0
def f(x):
    global cnt
    if val[x]!=INF:
        return val[x]
    tmp = 0
    cnt += 1
    if cnt >= N+1000:
        val[x]=INF-1
        return val[x]
    for ix,iw in e[x]:
        tmp = max(tmp,f(ix),iw)
    val[x] = tmp
    return val[x]
    


Q = int(input())
for i in range(N):
    f(i)
X = val[:]
X.sort()
for _ in range(Q):
    query = list(map(int,input().split()))
    if query[0]==1:
        x = query[1]
        print(cle(x,X))
    else:
        y = query[1]
        if val[y-1]==INF-1:
            print(-1)
        else:
            print(val[y-1])