#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
struct Edge {
	int to, id;
	Edge(int _to, int _id) :to(_to), id(_id) {}
};
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n; cin >> n;
	vector<vector<Edge>>to(n);
	rep2(i, 1, n) {
		int l, a; cin >> l >> a; a--;
		to[a].push_back({ i,l });
	}
	vector<int> dp(n, INF);
	priority_queue<P, vector<P>, greater<P>> pq;
	pq.push({ 0, 0 });
	dp[0] = 0;
	while (!pq.empty()) {
		auto tmp = pq.top();
		pq.pop();
		int level = tmp.first;
		int pos = tmp.second;
		if (level > dp[pos]) continue;
		for (Edge e : to[pos]) {
			int nlevel = max(level, e.id);
			int npos = e.to;
			if (chmin(dp[npos], nlevel)) pq.push({ nlevel, npos });
		}
	}
	auto cdp = dp;
	sort(all(cdp));
	int q; cin >> q;
	while (q--) {
		int t, x; cin >> t >> x;
		if (1 == t) {
			int ans = upper_bound(all(cdp), x) - cdp.begin();
			cout << ans << endl;
		}
		else {
			x--;
			int ans = dp[x];
			if (INF == dp[x])ans = -1;
			cout << ans << endl;
		}
	}
	return 0;
}