#include <bits/stdc++.h>
#define PB push_back
#define EB emplace_back
using namespace std;
typedef long long i64;
const int maxn = 1000000;
vector<int> g[maxn + 5];
i64 a[maxn + 5];
int dep[maxn + 5];
int anc[maxn + 5][20];
void dfs1(int u, int fa) {
	dep[u] = dep[fa] + 1;
	anc[u][0] = fa;
	for (int i = 1; (1 << i) < dep[u]; i++) anc[u][i] = anc[anc[u][i - 1]][i - 1];
	for (int v : g[u])
		if (v != fa) dfs1(v, u);
}
inline int lca(int x, int y) {
	if (dep[x] < dep[y]) swap(x, y);
	for (int i = 19; ~i; i--)
		if (dep[anc[x][i]] >= dep[y]) x = anc[x][i];
	if (x == y) return x;
	for (int i = 19; ~i; i--)
		if (anc[x][i] != anc[y][i]) x = anc[x][i], y = anc[y][i];
	return anc[x][0];
}
int nxt[70 * maxn + 5][2], siz[70 * maxn + 5];
int pcnt;
inline bool get(i64 v, int w) { return (v >> w) & 1; }
void insert(int& x, int op, i64 v) {
	x = ++pcnt;
	int p = x;
	for (int i = 61; ~i; i--) {
		int c = get(v, i);
		nxt[p][!c] = nxt[op][!c], nxt[p][c] = ++pcnt;
		siz[p] = siz[op] + 1;
		p = nxt[p][c], op = nxt[op][c];
	}
	siz[p] = siz[op] + 1;
}
int merge(int x, int y, int w = 61) {
	if (!x || !y) return x | y;
	int p = ++pcnt;
	if (w < 0) {
		siz[p] = siz[x] + siz[y];
		return p;
	}
	siz[p] = siz[x] + siz[y];
	nxt[p][0] = merge(nxt[x][0], nxt[y][0], w - 1);
	nxt[p][1] = merge(nxt[x][1], nxt[y][1], w - 1);
	return p;
}
int build(int p1, int p2, int p3, int p4, int p5, int w) {
	int p = ++pcnt;
	siz[p] = siz[p1] + siz[p2] - siz[p3] - siz[p4] + siz[p5];
	if (w < 0) return p;
	if (siz[nxt[p1][0]] + siz[nxt[p2][0]] - siz[nxt[p3][0]] - siz[nxt[p4][0]] + siz[nxt[p5][0]])
		nxt[p][0] = build(nxt[p1][0], nxt[p2][0], nxt[p3][0], nxt[p4][0], nxt[p5][0], w - 1);
	if (siz[nxt[p1][1]] + siz[nxt[p2][1]] - siz[nxt[p3][1]] - siz[nxt[p4][1]] + siz[nxt[p5][1]])
		nxt[p][1] = build(nxt[p1][1], nxt[p2][1], nxt[p3][1], nxt[p4][1], nxt[p5][1], w - 1);
	return p;
}
int rt[maxn + 5];
void dfs2(int u, int fa) {
	insert(rt[u], rt[fa], a[u]);
	for (int v : g[u])
		if (v != fa) dfs2(v, u);
}
i64 query(int p1, int p2, int p3, int p4, int p5, int m, i64 v = 0, int w = 61) {
	if (w < 0) return v;
	if (siz[nxt[p1][1]] + siz[nxt[p2][1]] - siz[nxt[p3][1]] - siz[nxt[p4][1]] + siz[nxt[p5][1]] >= m)
		return query(nxt[p1][1], nxt[p2][1], nxt[p3][1], nxt[p4][1], nxt[p5][1], m, v | (1LL << w), w - 1);
	int mg = build(nxt[p1][1], nxt[p2][1], nxt[p3][1], nxt[p4][1], nxt[p5][1], w - 1);
	return query(nxt[p1][0], nxt[p2][0], nxt[p3][0], nxt[p4][0], merge(nxt[p5][0], mg, w - 1), m, v, w - 1);
}
int main() {
	int n, q;
	scanf("%d", &n);
	for (int i = 1; i < n; i++) {
		int u, v;
		scanf("%d%d", &u, &v);
		g[u].PB(v), g[v].PB(u);
	}
	for (int i = 1; i <= n; i++) scanf("%lld", &a[i]);
	dfs1(1, 0), dfs2(1, 0);
	int bak = pcnt;
	scanf("%d", &q);
	i64 lstans = 0;
	for (int i = 1; i <= q; i++) {
		int x, y, m;
		scanf("%d%d%d", &x, &y, &m);
		x = (x ^ lstans) % n + 1, y = (y ^ lstans) % n + 1;
		int z1 = lca(x, y), z2 = anc[z1][0];
		if (dep[x] + dep[y] - 2 * dep[z1] + 1 < m) puts("0"), lstans = 0;
		else printf("%lld\n", lstans = query(rt[x], rt[y], rt[z1], rt[z2], 0, m));
		while (pcnt > bak) nxt[pcnt][0] = nxt[pcnt][1] = 0, pcnt--;
	}
}