#include<iostream>
#include<set>
#include<algorithm>
#include<vector>
#include<string>
#include<set>
#include<map>
#include<numeric>
#include<queue>
#include<tuple>
#include<cmath>
using namespace std;
typedef long long ll;
const ll INF=1LL<<60;
typedef pair<int,int> P;
typedef pair<int,P> PP;
const ll MOD=998244353;

int main(){
    int N;
    cin>>N;
    vector<vector<int>> G(N+1);
    vector<int> indeg(N+1,0);
    vector<int> L(N+1),A(N+1);
    vector<int> requiredlevel(N+1);
   
    for(int i=2;i<=N;i++){
        cin>>L[i]>>A[i];
        //state[L[i]].emplace_back(A[i],i);
        G[A[i]].push_back(i);//A[i]からiに辺をはる
        indeg[i]++;
        requiredlevel[i]=L[i];

    }

    

    priority_queue<P,vector<P>,greater<P>> pq;
    
    for(int to:G[1]){
        indeg[to]--;
        if(indeg[to]==0){
            pq.emplace(requiredlevel[to],to);
        }
    }

    map<int,int> minlevel;

    vector<bool> islearned(N+1,false);
    int nowlev=0;

    while(!pq.empty()){
        auto [lev,id]=pq.top();
        pq.pop();
        
        if(islearned[id]) continue;

        if(nowlev<lev){
            nowlev=lev;
        }

        minlevel[id]=nowlev;
        islearned[id]=true;

        for(int to:G[id]){
            indeg[to]--;
            if(indeg[to]==0 && !islearned[to]){
                pq.emplace(requiredlevel[to],to);
            }
        }
    }

    map<int,int> cnt;

    for(auto [id,lev]:minlevel){
        cnt[lev]++;//levのレベルでidの技を覚えられる
    }
    

    vector<pair<int,int>> ansq1;
    ansq1.emplace_back(0,1);
    int cntsum=1;
    for(auto [lev,num]:cnt){
        cntsum+=num;
        ansq1.emplace_back(lev,cntsum);
    }


   

    int Q;
    cin>>Q;
    vector<int> ans(Q);


    int t,x,y;
    for(int q=0;q<Q;q++){
        
        cin>>t;
        if(t==1){
            cin>>x;//レベルx

            auto it=upper_bound(ansq1.begin(),ansq1.end(),make_pair(x+1,-1));

            if(it==ansq1.begin()){
                ans[q]=-1;
            }else{
                it--;
                ans[q]=it->second;
            }

        }else{
            cin>>y;
            ans[q] =(minlevel.count(y)?minlevel[y]:-1);
        }
    }

    for(auto v:ans){
        cout<<v<<endl;
    }

}