#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n;
  cin >> n;
  VI l(n), a(n);
  rep(i, n) if (i) cin >> l[i] >> a[i], a[i]--;
  dsu d(n);
  rep(i, n) d.merge(i, a[i]);
  vector<char> valid(n);
  rep(i, n) valid[i] = d.same(i, 0);
  VI min_level(n, -1);
  rep(i, n) if (valid[i]) {
    auto dfs = [&](auto&& self, int i) -> int {
      if (i == 0) return 0;
      if (min_level[i] != -1) return min_level[i];
      return min_level[i] = max(self(self, a[i]), l[i]);
    };
    dfs(dfs, i);
  }
  VI levels;
  rep(i, n) if (valid[i]) levels.emplace_back(min_level[i]);
  sort(all(levels));
  int q;
  cin >> q;
  rep(_, q) {
    int type;
    cin >> type;
    if (type == 1) {
      int x;
      cin >> x;
      cout << upper_bound(all(levels), x) - levels.begin() << '\n';
    } else {
      int y;
      cin >> y;
      cout << min_level[y - 1] << '\n';
    }
  }
}