#include <iostream>
#include <vector>
#include <set>
#include <queue>
#include <stack>
#include <math.h>
#include <cassert>
#include <bitset>
#include <map>
#include <algorithm>
#include <iterator>
#include <string>
#include <utility>
#include <numeric>
#include <regex>
#include <complex>
#include <random>
#include <atcoder/all>
using namespace atcoder;
using namespace std;
using ll=long long;
using ull=unsigned long long;
using P=pair<ll,ll>;
template<typename T>using minque=priority_queue<T,vector<T>,greater<T>>;
template<typename T>bool chmax(T &a,const T &b){return (a<b?(a=b,true):false);}
template<typename T>bool chmin(T &a,const T &b){return (a>b?(a=b,true):false);}
template<typename T1,typename T2>
ostream &operator<<(ostream &os,const pair<T1,T2>&p){
  os<<p.first<<" "<<p.second;
  return os;
}
template<typename T1,typename T2>
istream &operator>>(istream &is,pair<T1,T2>&p){
  is>>p.first>>p.second;
  return is;
}
template<typename T>
istream &operator>>(istream &is,vector<T> &a){
  for(auto &i:a)is>>i;
  return is;
}
#define reps(i,a,n) for(int i=(a);i<(n);i++)
#define rep(i,n) reps(i,0,n)
#define all(x) x.begin(),x.end()
ll myceil(ll a,ll b){return (a+b-1)/b;}
int main(){
  int n;
  cin>>n;
  vector<vector<pair<int,int>>>to(n);
  rep(i,n-1){
    int l,a;
    cin>>l>>a;
    a--;
    to[a].push_back({l,i+1});
  }
  vector<int>ans(n,-1);
  ans[0]=0;
  queue<int>que;
  que.push(0);
  while(!que.empty()){
    int x=que.front();
    que.pop();
    for(auto i:to[x]){
      if(chmax(ans[i.second],max(ans[x],i.first))){
        que.push(i.second);
      }
    }
  }
  vector<int>c;
  rep(i,n){
    if(ans[i]!=-1)c.push_back(ans[i]);
  }
  sort(all(c));
  int q;
  cin>>q;
  while(q--){
    int t,x;
    cin>>t>>x;
    if(t==1){
      cout<<(upper_bound(all(c),x)-c.begin())<<endl;
    }
    else{
      cout<<ans[x-1]<<endl;
    }
  }
}