#include <bits/stdc++.h>

#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
const int INF = 1001001001;
const ll LINF = 1001001001001001001;
const ll MOD = 998244353;

// DFS
vector<bool> seen;
vector<int> level;
map<int,int> mp;
void dfs(const vector<vector<pair<int,int>>>& G, int V, int ma) {
  seen.at(V) = true;
  level.at(V) = ma;
  mp[ma]++;

  for (auto next : G.at(V)) {
    if (seen.at(next.first)) continue;
    dfs(G, next.first, max(ma,next.second));
  }
}

// 二分探索
int binarySearch(vector<pair<int,int>> Sorted,int K) {
  int ok = -1;
  int ng = Sorted.size();
  while(abs(ok-ng)>1) {
    int mid = (ok+ng)/2;
    bool flg = Sorted.at(mid).first<=K;
    if(flg) ok=mid;
    else ng=mid;
  }
  return ok;
}


int main() {
  int n;cin>>n;
  seen.resize(n);
  level.resize(n);
  for(int i=0;i<n;i++) level.at(i)=-2;
  level.at(0)=0;
  vector t(n, vector<pair<int,int>>());
  for(int i=1;i<n;i++) {
    int l,a;cin>>l>>a;
    a--;l--;
    t.at(a).push_back(make_pair(i,l));
  }

  dfs(t,0,0);

  vector<pair<int,int>> kind;
  for(auto ele : mp) {
    kind.push_back(ele);
  }
  sort(kind.begin(),kind.end());
  for(int i=1;i<kind.size();i++) {
    kind.at(i).second += kind.at(i-1).second;
  }

  int Q;cin>>Q;
  while(Q--) {
    int q,x;cin>>q>>x;x--;
    if(q==1) {
      int idx = binarySearch(kind, x);
      cout << kind.at(idx).second << endl;
    } else {
      cout << level.at(x)+1 << endl;
    }
  }

  exit(0);
}