#include <bits/stdc++.h>
 
using namespace std;
struct DataType {
  long long lv;
  int parent_id;
  char is_visited;
};

long long dfs(vector<DataType>& a, const int& id, map<int, int>& mp) {
  if (a[id].is_visited == 1) return a[id].lv;
  if (mp[id] == 1) { // loop
    a[id].lv = -1;
    a[id].is_visited = 1;
    return -1;
  }
  mp[id] = 1;
  long long lv = dfs(a, a[id].parent_id, mp);
  if (lv == -1) a[id].lv = -1;
  a[id].lv = max(a[id].lv, lv);
  a[id].is_visited = 1;
  return a[id].lv;
}

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, q;
  cin >> n;
  vector<DataType> a(n);
  a[0].lv = 0; a[0].parent_id = -1; a[0].is_visited = 1;
  for (int i=1;i<n;++i) {
    long long lv;
    int id;
    cin >> lv >> id;
    --id;
    a[i].lv = lv; a[i].parent_id = id; a[i].is_visited = 0;
  }
  cin >> q;
  vector<pair<long long, long long>> query(q);
  for (int i=0;i<q;++i) cin >> query[i].first >> query[i].second;

  map<int, int> mp;

  for (int i=0;i<n;++i) {
    if (a[i].is_visited == 1) continue;
    a[i].lv = dfs(a, i, mp);
    //for (const auto& e : a) cout << e.lv << ' ';
    //cout << '\n';
  }
  vector<long long> skills;
  for (int i=0;i<n;++i) {
    if (a[i].lv == -1) continue;
    skills.push_back(a[i].lv);
  }
  sort(skills.begin(), skills.end());

  //for (const auto& e : skills) cout << e << ' ';
  //cout << '\n';

  for (int i=0;i<q;++i) {
    if (query[i].first == 1) {
      auto lit = upper_bound(skills.begin(), skills.end(), query[i].second);
      int cnt = lit - skills.begin();
      cout << cnt << '\n';
    } else {
      cout << a[query[i].second-1].lv << '\n';
    }
  }
}