#include<iostream>
#include<cassert>
#include<queue>
#include<array>
#include<cstdio>
#include<algorithm>
#include<vector>
#include<cstring>
#define endl '\n'
using namespace std;
typedef long long ll;
typedef pair<ll,int> pii;

const int N=1e6+10,K=63;
int n;
vector<int> G[N];
ll val[N];
typedef vector<ll> Dat;

namespace IO{
    #define BUF_SIZE (1<<16)
    #define OUT_SIZE (1<<16)
    bool IOerror=0;
    inline char nc(){static char buf[BUF_SIZE],*p1=buf+BUF_SIZE,*pend=buf+BUF_SIZE;if(p1==pend){p1=buf;pend=buf+fread(buf,1,BUF_SIZE,stdin);if(pend==p1)return IOerror=1,-1;}return *p1++;}
    inline bool blank(char ch){return ch==' '||ch=='\n'||ch=='\r'||ch=='\t';}
    inline void read(int &x){bool sign=0;char ch=nc();x=0;for(;blank(ch);ch=nc());if(IOerror)return;if(ch=='-')sign=1,ch=nc();for(;ch>='0'&&ch<='9';ch=nc())x=x*10+ch-'0';if(sign)x=-x;}
    inline void read(ll &x){bool sign=0;char ch=nc();x=0;for(;blank(ch);ch=nc());if(IOerror)return;if(ch=='-')sign=1,ch=nc();for(;ch>='0'&&ch<='9';ch=nc())x=x*10+ch-'0';if(sign)x=-x;}
    struct Ostream_fwrite{
        char *buf,*p1,*pend;
        Ostream_fwrite(){buf=new char[BUF_SIZE];p1=buf;pend=buf+BUF_SIZE;}
        inline void out(char ch){if(p1==pend){fwrite(buf,1,BUF_SIZE,stdout);p1=buf;}*p1++=ch;}
        inline void print(ll x){static char s[25],*s1;s1=s;if(!x)*s1++='0';if(x<0)out('-'),x=-x;while(x)*s1++=x%10+'0',x/=10;while(s1--!=s)out(*s1);}
        inline void println(ll x){print(x);out('\n');}
        inline void flush(){if(p1!=buf){fwrite(buf,1,p1-buf,stdout);p1=buf;}}
        ~Ostream_fwrite(){flush();}
    }Ostream;
    inline void print(ll x){Ostream.print(x);}
    inline void println(ll x){Ostream.println(x);}
    inline void println(){Ostream.out('\n');}
    inline void flush(){Ostream.flush();}
    #undef OUT_SIZE
    #undef BUF_SIZE
}using namespace IO;

const int H=20
;
ll f[H][N];
int fp[H][N];
struct DS{
    void build(int n,ll* a){
        for(int i=1;i<=n;i++)f[0][i]=a[i],fp[0][i]=i;
        for(int i=1;i<H;i++)
            for(int j=1;j+(1<<i)-1<=n;j++)
                f[i][j]=max(f[i-1][j],f[i-1][j+1<<i-1]),
                fp[i][j]=f[i-1][j]>f[i-1][j+(1<<i-1)]?fp[i-1][j]:fp[i-1][j+(1<<i-1)];
    }
    pii query(int l,int r){
        if(l>r)return {0,0};
        int len=r-l+1,h=__lg(len);
        ll v=max(f[h][l],f[h][r-(1<<h)+1]);
        int p=v==f[h][l]?fp[h][l]:fp[h][r];
        return {v,p};
    }
} ds;

int dfn[N],top[N],dcnt,siz[N],son[N],fa[N],dep[N];
ll arr[N];
void dfs1(int u,int f){
    fa[u]=f,dep[u]=dep[f]+1,siz[u]=1;
    for(int v:G[u]){
        if(v==f)continue;
        dfs1(v,u);
        siz[u]+=siz[v];
        if(siz[son[u]]<siz[v])son[u]=v;
    }
}
void dfs2(int u,int tp){
    top[u]=tp,dfn[u]=++dcnt,arr[dfn[u]]=val[u];
    if(son[u])dfs2(son[u],tp);
    for(int v:G[u]){
        if(v==son[u]||v==fa[u])continue;
        dfs2(v,v);
    }
}
typedef array<ll,4> rg;
struct cmp{
    bool operator()(const rg& a,const rg& b) const{
        return a[0]<b[0];
    }
};
typedef priority_queue<rg,vector<rg>,cmp> pqt;
void insertRange(int l,int r,pqt& pq){
    auto res=ds.query(l,r);
    pq.push({res.first,res.second,l,r});
};
Dat queryPoints(int u,int v,int m){
    Dat res;
    pqt pq;
    while(top[u]!=top[v]){
        if(dep[top[u]]<dep[top[v]])swap(u,v);
        insertRange(dfn[top[u]],dfn[u],pq);
        u=fa[top[u]];
    }
    if(dep[u]<dep[v])swap(u,v);
    insertRange(dfn[v],dfn[u],pq);
    while(pq.size()&&res.size()<m){
        auto a=pq.top();
        pq.pop();
        res.push_back(a[0]);
        if(a[1]!=a[2])insertRange(a[2],a[1]-1,pq);
        if(a[1]!=a[3])insertRange(a[1]+1,a[3],pq);
    }
    return res;
}
ll queryVal(Dat& dt,int m){
    ll ans=0;
    for(int i=K;i>=0;i--){
        int cnt=0;
        Dat ndt;
        for(ll j:dt)if(j>>i&1)cnt++,ndt.push_back(j);
        if(cnt>=m){
            ans|=(1ll<<i);
            dt=ndt;
        }
    }
    return ans;
}

signed main(){
    read(n);
    for(int i=1;i<n;i++){
        int u,v;
        read(u),read(v);
        G[u].push_back(v);
        G[v].push_back(u);
    }
    for(int i=1;i<=n;i++)read(val[i]);
    dfs1(1,0);
    dfs2(1,1);
    ds.build(n,arr);
    int q;
    read(q);
    ll lastans=0;
    for(int i=1;i<=q;i++){
        int u,v,m;
        read(u),read(v),read(m);
        u=(u^lastans)%n+1,v=(v^lastans)%n+1;
        Dat dt=queryPoints(u,v,K*min(3,m-1));
        if(dt.size()<m){
            lastans=0;
        }else lastans=queryVal(dt,m);
        println(lastans);
    }
    return 0;
}