#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for (int i=0;i<(int)(n);i++)

int main(){
  int n;
  cin>>n;
  vector<int> l(n,0),a(n,0);
  rep(i,n-1) cin>>l.at(i+1)>>a.at(i+1);
  rep(i,n) a.at(i)--;
  vector<vector<int>> g(n);
  rep(i,n-1){
    g.at(a.at(i+1)).push_back(i+1);
  }
  priority_queue<pair<int,int>,vector<pair<int,int>>,greater<pair<int,int>>> pq;
  pq.push({0,0});
  vector<int> q1;
  vector<int> q2(n,-1);
  while(!pq.empty()){
    auto [lv,nw]=pq.top();
    pq.pop();
    q2.at(nw)=lv;
    q1.push_back(lv);
    for(int nx:g.at(nw)){
      pq.push({max(lv,l.at(nx)),nx});
    }
  }
  int q;
  cin>>q;
  rep(Qi,q){
    int t,x;
    cin>>t>>x;
    if(t==1){
      int ans=upper_bound(q1.begin(),q1.end(),x)-q1.begin();
      cout<<ans<<'\n';
    }else{
      cout<<q2.at(x-1)<<'\n';
    }
  }
}