#include <bits/stdc++.h>
using namespace std;
int n;
bool ok = 1;
int ot[100005][2];
struct node {
    node* fa[20];
    int depth;
    vector<node*> gra;
    bool vis;
    int mx;
} tree[100005];
void dfs(node* lo, bool ij, int dis) {
    ot[lo - tree][ij] = dis;
    for (int i = 0; i < lo->gra.size(); i++) {
        if (ot[lo->gra[i] - tree][ij] == -1)
            dfs(lo->gra[i], ij, dis + 1);
    }
}
int ans(node* a, node* b) {
    if (ok == 0) {
        for (int i = 1; i <= n; i++) {
            ot[i][0] = -1;
            ot[i][1] = -1;
        }
        dfs(a, 0, 0);
        dfs(b, 1, 0);
        int rt = 0;
        for (int i = 1; i <= n; i++) rt = max(rt, min(ot[i][0], ot[i][1]));
        return rt;
    }
    int ca = a - tree, cb = b - tree;
    if (ca > cb)
        swap(ca, cb);
    return max(ca - 1, max((cb - ca) / 2, n - cb));
}
int main() {
    scanf("%d", &n);
    for (int i = 1; i < n; i++) {
        int u, v;
        scanf("%d%d", &u, &v);
        if (u != v - 1)
            ok = 0;
        tree[u].gra.push_back(v + tree);
        tree[v].gra.push_back(u + tree);
    }
    tree[1].depth = 1;
    long long m, x, y;
    scanf("%lld%lld%lld", &m, &x, &y);
    long long out = 0;
    x %= n;
    x += 1;
    y %= n;
    y += 1;
    while (m--) {
        long long cans = ans(x + tree, y + tree);
        out ^= cans * cans;
        x = ((x ^ cans) + cans) % n + 1;
        y = ((y ^ cans) + cans) % n + 1;
    }
    cout << out;
    return 0;
}