#include <bits/stdc++.h>
//#include <atcoder/all>
//using namespace atcoder;
using namespace std;
const int INF = 1e9;
using ll = long long;
using inv = vector<int>;
using stv = vector<string>;
using pint = pair<int,int>;
#define FOR(i,l,r) for(int i=(l); i<(r); i++)
#define rep(i,r) for(int i=0; i<(r); i++)
#define repl(i,r) for(long long i=0; i<(r); i++)
#define FORl(i,l,r) for(long long i=(l); i<(r); i++)
#define INFL ((1LL<<62)-(1LL<<31))
#define pb(x) push_back(x)
#define CIN(x) cin >> x

// to and cost
using Graph = vector<vector<pair<ll,ll>>>;

void dfs(Graph G,int v,ll nowlv, vector<ll> &lv, vector<bool> &seen){
  seen[v] = true;
  lv[v] = nowlv;
  if(G[v].size() == 0) return;
  
  for(auto [nexv,l] : G[v]){
    if(seen[nexv]) continue;
    dfs(G,nexv,(nowlv > l ? nowlv:l),lv,seen);
  }

}

int main(){
  ll N;
  cin >> N;
  Graph G(N,vector<pair<ll,ll>>());

  vector<ll> minl(N,-1LL);
  vector<bool> seen(N,false);
  seen[0] = true;

  rep(i,N-1){
    ll L,A;
    cin >> L >> A;
    A--;
    G[A].pb(make_pair(i+1,L));
  }

  dfs(G,0,1,minl,seen);

  // rep(i,N) cout << minl[i] << " ";
  // cout<< endl;


  ll Q;
  cin >> Q;
  rep(q,Q){
    int t;
    cin >> t;
    if(t == 1){
      ll x;
      cin >> x;

      ll ans= 0;
      rep(i,N) if(minl[i] != -1 && minl[i] <= x) ans++;
      cout << ans << endl;

    }else{
      int y;
      cin >> y;
      y--;
      cout << minl[y] << endl;
    }
  }

}