from bisect import bisect_left, bisect_right
from collections import defaultdict


def find_interval(a: list, lo: int, hi: int) -> tuple[int, int, int]:
    """
    ソート済みリスト a の要素の lo 以上 hi 以下の個数と区間を返す
    return: 範囲内の個数, l, r
    """
    assert lo <= hi
    empty = 0, -1, -1  # 区間なし
    if not a or lo > a[-1] or hi < a[0]: return empty

    l = bisect_left(a, lo)
    r = bisect_right(a, hi) - 1
    if l > r: return empty
    return r-l+1, l, r


N = int(input())
skills = [(0, 0)]
adj = defaultdict(list)
for i in range(N-1):
    L, A = map(int, input().split())
    A -= 1

    skills.append((L, A))
    adj[A].append(i+1)


Q = int(input())
queries = []
for _ in range(Q):
    qs = list(map(int, input().split()))
    queries.append(qs)


def dfs(si, lv):
    levels[si] = max(levels[si], lv)

    for to in adj[si]:
        dfs(to, max(lv, skills[to][0]))


levels = [-1] * N
dfs(0, 0)
levels_sorted = sorted(levels)
for i in range(len(queries)):
    qs = queries[i]
    if qs[0] == 1:
        x = qs[1]
        cnt, _, _ = find_interval(levels_sorted, 0, x)
        print(cnt)
    elif qs[0] == 2:
        y = qs[1]-1
        print(levels[y])