#include using namespace std; #define FOR(i,m,n) for(int i=(m);i<(n);++i) #define REP(i,n) FOR(i,0,n) #define ALL(v) (v).begin(),(v).end() using ll = long long; constexpr int INF = 0x3f3f3f3f; constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL; constexpr double EPS = 1e-8; constexpr int MOD = 998244353; // constexpr int MOD = 1000000007; constexpr int DY4[]{1, 0, -1, 0}, DX4[]{0, -1, 0, 1}; constexpr int DY8[]{1, 1, 0, -1, -1, -1, 0, 1}; constexpr int DX8[]{0, -1, -1, -1, 0, 1, 1, 1}; template inline bool chmax(T& a, U b) { return a < b ? (a = b, true) : false; } template inline bool chmin(T& a, U b) { return a > b ? (a = b, true) : false; } struct IOSetup { IOSetup() { std::cin.tie(nullptr); std::ios_base::sync_with_stdio(false); std::cout << fixed << setprecision(20); } } iosetup; int main() { int n; cin >> n; vector l(n, 0); vector> graph(n); FOR(i, 1, n) { int a; cin >> l[i] >> a; --a; graph[a].emplace_back(i); }; vector level(n, INF); level[0] = 0; queue que({0}); while (!que.empty()) { const int skill = que.front(); que.pop(); for (const int e : graph[skill]) { level[e] = max(l[e], level[skill]); que.emplace(e); } } vector can_rem; REP(i, n) { if (level[i] != INF) can_rem.emplace_back(level[i]); } int q; cin >> q; while (q--) { int type; cin >> type; if (type == 1) { int x; cin >> x; cout << distance(can_rem.begin(), ranges::upper_bound(can_rem, x)) << '\n'; } else if (type == 2) { int y; cin >> y; --y; cout << (level[y] == INF ? -1 : level[y]) << '\n'; } } return 0; }