#include <bits/stdc++.h>
using namespace std; 
typedef long long i64; 
const int N = 1e6 + 5; 

int n, q, id[N]; 
i64 a[N]; 
int sz[N], dep[N], f[N]; 
int dfn[N], top[N], son[N], num; 
vector<int> G[N]; 

void dfs1(int x, int fa) {
    dep[x] = dep[f[x] = fa] + 1; sz[x] = 1; 
    for (int y : G[x]) if (y != fa) {
        dfs1(y, x); 
        if (sz[y] > sz[son[x]]) son[x] = y; 
    }
}
void dfs2(int x, int topf) {
    dfn[x] = ++num; top[x] = topf; 
    if (!son[x]) return; dfs2(son[x], topf); 
    for (int y : G[x]) if (y != f[x] && y != son[x]) dfs2(y, y); 
}

vector<int> T[N * 4]; 
void update(int o, int l, int r, int x, i64 k) { // 从小到大插入数
    T[o].emplace_back(k); 
    if (l == r) return; 
    int mid = l + r >> 1; 
    if (x <= mid) update(o << 1, l, mid, x, k);
    else update(o << 1 | 1, mid + 1, r, x, k);
}
vector<pair<int, int>> s; 
vector<int> now; 
void query(int o, int l, int r, int x, int y) {
    if (x <= l && r <= y) return s.emplace_back(o, 0), void(); 
    int mid = l + r >> 1; 
    if (x <= mid) query(o << 1, l, mid, x, y); 
    if (mid < y) query(o << 1 | 1, mid + 1, r, x, y); 
}
i64 query(int x, int y, int k) {
    s.clear(), now.clear(); 
    while (top[x] != top[y]) {
        if (dep[top[x]] < dep[top[y]]) swap(x, y); 
        query(1, 1, n, dfn[top[x]], dfn[x]), x = f[top[x]]; 
    }
    if (dep[x] > dep[y]) swap(x, y); 
    query(1, 1, n, dfn[x], dfn[y]); 
    i64 ans = 0; 
    for (int i = 61; i >= 0; --i) {
        int cnt = 0; 
        for (auto [node, p] : s) {
            while ((T[node][p] >> i & 1) && (T[node][p] & ans) == ans) {
                ++p; ++cnt; 
                if (cnt >= k) break; 
            }
            if (cnt >= k) break; 
        }
        for (auto val : now) {
            if (cnt >= k) break; 
            if ((val >> i & 1) && (val & ans) == ans) ++cnt; 
        }
        if (cnt >= k) { ans |= 1ll << i; continue; }
        for (auto &[node, p] : s)
            while ((T[node][p] >> i & 1) && (T[node][p] & ans) == ans) now.emplace_back(T[node][p++]); 
    }
    return ans; 
}

int main(void) {
    ios::sync_with_stdio(0); cin.tie(0); 
    cin >> n; 
    for (int i = 1; i < n; ++i) {
        int x, y; cin >> x >> y; 
        G[x].emplace_back(y); G[y].emplace_back(x); 
    } dfs1(1, 0); dfs2(1, 1); 
    for (int i = 1; i <= n; ++i) cin >> a[i], id[i] = i; 
    sort(id + 1, id + n + 1, [&](int x, int y) { return a[x] > a[y]; }); 
    for (int i = 1; i <= n; ++i) update(1, 1, n, dfn[id[i]], a[id[i]]); 
    cin >> q; 
    for (i64 lst = 0; q--; ) {
        int x, y, k; cin >> x >> y >> k; 
        x = (x ^ lst) % n + 1, y = (y ^ lst) % n + 1; 
        cout << (lst = query(x, y, k)) << '\n'; 
    }
    return 0; 
}