#include using namespace std; void fast_io() { ios_base::sync_with_stdio(false); cin.tie(nullptr); } int main() { fast_io(); int n; cin >> n; vector>> g(n); for (int i = 1; i < n; i++) { int l, a; cin >> l >> a; a--; g[a].push_back({i, l}); } deque dq{0}; vector dp(n, -1); dp[0] = 0; while (!dq.empty()) { int v = dq.front(); dq.pop_front(); for (auto [u, l] : g[v]) { if (dp[u] == -1) { dp[u] = max(dp[v], l); dq.push_back(u); } } } map cnt; for (int i = 0; i < n; i++) { if (dp[i] != -1) { cnt[dp[i]]++; } } vector> cnts; for (auto [l, c] : cnt) { cnts.push_back({l, c}); } for (int i = 1; i < cnts.size(); i++) { cnts[i].second += cnts[i - 1].second; } int q; cin >> q; for (; q--;) { int query, x; cin >> query >> x; if (query == 1) { auto it = lower_bound(cnts.begin(), cnts.end(), make_pair(x + 1, 0)); cout << prev(it)->second << '\n'; } else { cout << dp[x - 1] << "\n"; } } }