#include<bits/stdc++.h>
using namespace std;
using ll = long long;

int main(){
    int n;
    cin>>n;
    vector<ll> l(n,0),a(n,0);
    vector<vector<int>> g(n);
    for(int i = 1;i<n;i++){
        cin>>l[i]>>a[i];
        a[i]--;
        g[a[i]].push_back(i);
    }
    using dat = pair<ll,int>;
    priority_queue<dat,vector<dat>,greater<dat>> que;
    vector<int> vis(n,0);
    que.push(make_pair(0ll,0));
    while(que.size()){
        dat now = que.top();
        que.pop();
        int ni = now.second;
        vis[ni] = 1;
        for(auto&e:g[ni]){
            l[e] = max(l[e],l[ni]);
            que.push(make_pair(l[e],e));
        }
    }
    vector<int> can;
    for(int i = 0;i<n;i++) if(vis[i])can.push_back(l[i]);
    sort(can.begin(),can.end());
    int q;
    cin>>q;
    while(q--){
        int op;
        cin>>op;
        if(op==1){
            int x;
            cin>>x;
            int ni = upper_bound(can.begin(),can.end(),x) - can.begin();
            cout<<ni<<endl;
        }else{
            int x;
            cin>>x;
            x--;
            if(vis[x]==0) cout<<-1<<endl;
            else cout<<l[x]<<endl;
        }
    }


        

     
}