#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
#define Sort(vector) sort(vector.begin(), vector.end())
#define Reverse(vector) reverse(vector.begin(), vector.end())
#define RSort(vector) sort(vector.rbegin(), vector.rend())
using ll = long long;
using P = pair<ll,ll>;
using TU = tuple<int,int,int>;
using vint = vector<int>;
using vvint = vector<vint>;
using vvvint = vector<vvint>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
template<typename T> istream &operator>>(istream &is,vector<T> &v){for(T &in:v){is>>in;}return is;}
template<typename T> ostream &operator<<(ostream &os,vector<T> &v){for(int i=0;i<(int)v.size();i++){os<<v[i]<<" \n"[i==(int)v.size()-1];}return os;}
template<typename T> istream &operator>>(istream &is,vector<vector<T>> &v){for(vector<T> &in:v){is>>in;}return is;}
template<typename T> ostream &operator<<(ostream &os,vector<vector<T>> &v){for(vector<T> &out:v){os<<out;}return os;}




int main(){
  int n;cin>>n;
  vector<P> waza(n+1);
  for(int i=2;i<=n;i++){
    ll l,a;cin>>l>>a;
    waza[i]={l,a};
  }
  waza[1]={0,0};
  // waza[0]={0,-1};

  vector<vector<P>> nxtWaza(n+1);
  for(int i=2;i<=n;i++){
    auto [l,a]=waza[i];
    nxtWaza[a].push_back({l,i});
  }

  const ll INF=1e15;
  vll lowerLv(n+1,INF); // lowerLv[i]:=技iを覚えるのに必要な最小レベル
  lowerLv[0]=-1;

  auto dfs=[&](auto f,int now,ll lv)->void{
    // 技nowを覚える
    lowerLv[now]=lv;

    for(auto [l,nxt]:nxtWaza[now]){
      f(f,nxt,max(lv,l));
    }
  };

  dfs(dfs,1,0);

  vll cp=lowerLv;
  cp[0]=INF;
  Sort(cp);

  int q;cin>>q;
  rep(_,q) {
    ll c,x;cin>>c>>x;

    if(c==1){
      int res=upper_bound(cp.begin(),cp.end(),x)-cp.begin();
      // res--;
      cout<< res <<'\n';
    }else{
      if(lowerLv[x]!=INF) cout<< lowerLv[x] <<'\n';
      else cout<< -1 <<'\n';
    }
  }

  return 0;
}