#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;

// type
typedef long long ll;
typedef long double ld;
template<class T> using pq = priority_queue<T>;
template<class T> using pqg = priority_queue<T, vector<T>, greater<T>>;
template<class T> using v = vector<T>;
#define pl pair<ll, ll>
#define vl v<ll>
#define vp v<pl>
#define vm v<mint>
 
// IN-OUT
#define NYAN ios::sync_with_stdio(false);cin.tie(nullptr);cout<<fixed<<setprecision(15);
void Yes(bool b=1) { cout << ( b == 1 ? "Yes" : "No" ) << "\n"; }
void YES(bool b=1) { cout << ( b == 1 ? "YES" : "NO" ) << "\n"; }
void No(bool b=1) { cout << ( b == 1 ? "No" : "Yes" ) << "\n"; }
void NO(bool b=1) { cout << ( b == 1 ? "NO" : "YES" ) << "\n"; }
void CIN() {}
template <typename T, class... U> void CIN(T &t, U &...u) { cin >> t; CIN(u...); }
void COUT() { cout << "\n"; }
template <typename T, class... U, char sep = ' '> void COUT(const T &t, const U &...u) { cout << t; if (sizeof...(u)) cout << sep; COUT(u...); }
#define dump(x) cerr << #x << ":"<< x << "\n";
#define vdump(x) rep(repeat, sz(x)) cerr << repeat << ":" << x[repeat] << "\n";
 
// macro
#define bp __builtin_popcountll
#define ALL(x) x.begin(),x.end()
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define reps(i, s, n) for (ll i = s; i < (ll)(n); i++)
#define sz(x) (ll)x.size()
ll xd[]={0, 1, 0, -1, 1, 1, -1, -1};
ll yd[]={1, 0, -1, 0, 1, -1, -1, 1};

// function
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
ll rmax(ll a, ll b){return max(a, b);}
ll rmin(ll a, ll b){return min(a, b);}
ll rsum(ll a, ll b){return a + b;}
ll rzero(){return 0;}

// constant
long double PI = 3.14159265358979;
#define INF32 2147483647
#define INF64 9223372036854775807
#define INF 922337203685477580
using mint = modint998244353;
// using mint = modint1000000007;


/* SOLVE BEGIN ************************************************************************** */

void solve()
{
  ll n;
  cin >> n;
  vl l(n), a(n);
  v<vl> edge(n);
  reps(i, 1, n){
    cin >> l[i] >> a[i];
    a[i]--;
    edge[a[i]].emplace_back(i);
  }
  
  vl L(n, -1);
  L[0] = 0;
  queue<ll> Q;
  Q.emplace(0);
  while(sz(Q)){
    auto now = Q.front(); Q.pop();
    for(auto next : edge[now]){
      L[next] = max(L[now], l[next]);
      Q.emplace(next);
    }
  }
  
  map<ll, ll> mp;
  rep(i, n) mp[L[i]]++;
  ll sum = 0;
  for(auto [f, s] : mp){
    if(f == -1) continue;
    sum += s;
    mp[f] = sum;
  }
  
  ll q;
  cin >> q;
  while(q--){
    ll op; cin >> op;
    ll x; cin >> x;
    if(op == 1){
      auto it = mp.upper_bound(x);
      if(it == mp.begin()) cout << 0 << "\n";
      else{
        it--;
        auto [f, s] = *it;
        cout << s << "\n";
      }
    }else{
      x--;
      cout << L[x] << "\n";
    }
  }
}

int main()
{
  NYAN
  solve();
  return 0;
}