#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
using ld = long double;
using mint = modint998244353;

int main() {
  int N; cin >> N;
  vector<int> L(N), A(N);
  vector<vector<pair<int, int>>> G(N);
  for (int i = 1; i < N; i++) {
    cin >> L[i] >> A[i]; A[i]--;
    G[A[i]].push_back({i, L[i]});
  }
  vector<int> ds(N, -1), ls;
  ds[0] = 0;
  queue<int> que;
  que.push(0);
  while (!que.empty()) {
    int u = que.front(); que.pop();
    ls.push_back(ds[u]);

    for (auto &x: G[u]) {
      int v = x.first, vd = max(ds[u], x.second);
      ds[v] = vd;
      que.push(v);
    }
  }
  sort(ls.begin(), ls.end());

  int Q; cin >> Q;
  while (Q--) {
    int t, x; cin >> t >> x;
    if (t == 1) {
      cout << upper_bound(ls.begin(), ls.end(), x) - ls.begin() << endl;
    } else {
      cout << ds[x - 1] << endl;
    }
  }
  return 0;
}