#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
template<class T> bool chmax(T &a, const T &b) { if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------

int N;
int L[202020],A[202020];
vector<int> RE[202020];
int TL[202020];
vector<int> SL;

int Q;

void dfs(int cur) {
	TL[cur]=max(TL[cur],L[cur]);
	SL.push_back(TL[cur]);
	FORR(e,RE[cur]) {
		TL[e]=TL[cur];
		dfs(e);
	}
}

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>N;
	for(i=1;i<N;i++) {
		cin>>L[i]>>A[i];
		TL[i]=1<<30;
		A[i]--;
		RE[A[i]].push_back(i);
	}
	dfs(0);
	sort(ALL(SL));
	cin>>Q;
	while(Q--) {
		cin>>i>>x;
		if(i==1) {
			cout<<lower_bound(ALL(SL),x+1)-SL.begin()<<endl;
		}
		else {
			y=TL[x-1];
			if(y==1<<30) y=-1;
			cout<<y<<endl;
		}
	}
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}