#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define N 1000100
ll n,q;vector<ll>e[N];ll a[N];
ll dfn[N],siz[N],son[N],top[N],dep[N],fa[N];ll dfncnt=0;
inline void dfs(ll x,ll faa){
    fa[x]=faa;dep[x]=dep[faa]+1;siz[x]=1;
    for(auto o:e[x]){
        if(o==faa)continue;
        dfs(o,x);siz[x]+=siz[o];
        if(siz[o]>siz[son[x]])son[x]=o;
    }return ;
}
inline void dfs1(ll x,ll tp){
    dfn[x]=++dfncnt;top[x]=tp;
    if(son[x]){
        dfs1(son[x],tp);
    }for(auto o:e[x]){
        if(!dfn[o])dfs1(o,o);
    }return ;
}
#define V 21000100
ll fir[N<<2],nxt[V],val[V];ll cnt=0;
inline void add(ll x,ll y){val[++cnt]=y;nxt[cnt]=fir[x];fir[x]=cnt;return ;}
inline void upd(ll o,ll l,ll r,ll x,ll y){
    add(o,y);if(l==r)return ;
    ll mid=(l+r)>>1;
    if(mid>=x)upd(o<<1,l,mid,x,y);
    else upd(o<<1|1,mid+1,r,x,y);
    return ;
}
ll p[N];inline bool cmp(ll x,ll y){return a[x]>a[y];}
vector<ll>hs,rc;
inline void ask(ll o,ll l,ll r,ll x,ll y){
    if(x<=l&&r<=y){hs.emplace_back(fir[o]);return ;}
    ll mid=(l+r)>>1;
    if(mid>=x)ask(o<<1,l,mid,x,y);
    if(mid<y)ask(o<<1|1,mid+1,r,x,y);
    return ;
}
inline ll ask(ll x,ll y,ll z){
    hs.clear();rc.clear();while(top[x]!=top[y]){
        if(dep[top[x]]<dep[top[y]])swap(x,y);
        ask(1,1,n,dfn[top[x]],dfn[x]);x=fa[top[x]];
    }if(dep[x]>dep[y])swap(x,y);ask(1,1,n,dfn[x],dfn[y]);
    ll an=0;for(int i=62;i>=0;i--){
        ll cn=0;for(auto o:hs){
            while(((val[o]&an)==an)&&((val[o]>>i)&1)){cn++;if(cn>=z)break;o=nxt[o];}
        }for(auto o:rc){if(((val[o]&an)==an)&&((val[o]>>i)&1))cn++;if(cn>=z)break;}
        // cout<<cn<<'\n';
        if(cn>=z){an+=(1ll<<i);continue;}
        for(auto &o:hs){while(((val[o]&an)==an)&&((val[o]>>i)&1))rc.emplace_back(o),o=nxt[o];}
    }return an;
}
int main(){
//	freopen("test1.in","r",stdin);
	//freopen(".in","r",stdin);
	//freopen(".out","w",stdout);
	ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
	cin>>n;for(int i=1;i<n;i++){
        ll u,v;cin>>u>>v;e[u].push_back(v);e[v].push_back(u);
    }for(int i=1;i<=n;i++)cin>>a[i];
    dfs(1,0);dfs1(1,1);
    for(int i=1;i<=n;i++)p[i]=i;sort(p+1,p+n+1,cmp);
    for(int i=1;i<=n;i++)upd(1,1,n,dfn[p[i]],a[p[i]]);
    cin>>q;ll las=0;for(int i=1;i<=q;i++){
        ll x,y,z;cin>>x>>y>>z;x=(x^las)%n+1;y=(y^las)%n+1;
        cout<<(las=ask(x,y,z))<<'\n';
    }return 0;
}