#include <bits/stdc++.h>
#include <atcoder/dsu>
using namespace std;
using ll = long long;
const int maxn = 2<<17;
const ll inf = 2e9;
int N, Q;
int L[maxn],A[maxn];
vector<int> G[maxn];
int dp[maxn];
int main() {
    std::ios_base::sync_with_stdio(false);
    std::cin.tie(nullptr);
    cin >> N;
    atcoder::dsu uf(N);
    dp[0] = 0;
    for(int i = 1; i < N; i++) {
        cin >> L[i] >> A[i];
        A[i]--;
        uf.merge(i, A[i]);
        G[A[i]].push_back(i);
        dp[i]=inf;
    }
    cin >> Q;
    {
        queue<int> q;
        q.push(0);
        while(q.size()) {
            int v=q.front();q.pop();
            for(int u:G[v]){
                dp[u]=max(dp[v],L[u]);
                q.push(u);
            }
        }
    }
    vector<int>B;
    for(int i = 0; i < N; i++) if(dp[i]!=inf) B.push_back(dp[i]);
    sort(B.begin(),B.end());
    while(Q--) {
        int op, x;
        cin >> op >> x;
        if(op==1) {
            cout << (upper_bound(B.begin(),B.end(),x)-B.begin())<<"\n";
        } else {
            x--;
            cout<<(dp[x]==inf?-1:dp[x]) <<"\n";
        }
    }

}