#include<bits/stdc++.h>
#define N 100000
using namespace std;
int n, q, r, l;
vector<int> a[N];
int dfs(int k){
	for(int i=0;i<a[k].size();i++){
		if(a[k][i]!=r-k)
			dfs(a[k][i]);
		else return k;
	}
}
int main(){
	freopen("query.in","r",stdin);
	freopen("query.out","w",stdout);
	cin >> n;
	for(int i=1;i<n;i++){
		int u,v;
		cin>>u>>v;
		a[u].push_back(v);
	}
	cin>>q;
	for(int i=1;i<=q;i++){
		int k;
		cin>>l>>r>>k;
	
		cout<< dfs(1) <<endl;
	}
	
	return 0;
}