#include <stdio.h>
#include <atcoder/all>
#include <bits/stdc++.h>
using namespace std;
using namespace atcoder;
using mint = modint998244353;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf32 1000000001
#define Inf64 4000000000000000001


int main(){
	
	int n;
	cin>>n;
	vector E(n,vector<pair<int,long long>>());
	rep(i,n-1){
		int a,b;
		cin>>a>>b;
		b--;
		E[b].emplace_back(i+1,a);
	}
	
	vector<long long> d(n,Inf64);
	d[0] = 0;
	priority_queue<pair<long long,int>,vector<pair<long long,int>>,greater<pair<long long,int>>> Q;
	Q.emplace(0,0);
	while(Q.size()>0){
		long long D = Q.top().first;
		int u = Q.top().second;
		Q.pop();
		if(d[u]!=D)continue;
		rep(i,E[u].size()){
			int v = E[u][i].first;
			long long nD = max(D,(long long)E[u][i].second);
			if(d[v]>nD){
				d[v] = nD;
				Q.emplace(nD,v);
			}
		}
	}

	vector<long long> dd = d;
	sort(dd.begin(),dd.end());
	int q;
	cin>>q;
	rep(_,q){
		int t,x;
		cin>>t>>x;
		if(t==1){
			cout<<distance(dd.begin(),upper_bound(dd.begin(),dd.end(),x))<<endl;
		}
		else{
			long long ans = d[x-1];
			if(ans==Inf64)ans = -1;
			cout<<ans<<endl;
		}
	}
	
	return 0;
}