#include <bits/stdc++.h>
using namespace std;
int n;
int ot[100005][2];
struct node {
    node* fa[20];
    int depth;
    vector<node*> gra;
    bool vis;
    int mx;
} tree[100005];
void make_tree(node* lo) {
    lo->vis = 1;
    for (int i = 1; i < 20; i++) lo->fa[i] = NULL;
    for (int i = 2, ind = 1; i < lo->depth; i *= 2, ind++) lo->fa[ind] = lo->fa[ind - 1]->fa[ind - 1];
    for (int i = 0; i < lo->gra.size(); i++) {
        if (lo->gra[i]->vis)
            continue;
        node* to = lo->gra[i];
        to->depth = lo->depth + 1;
        to->fa[0] = lo;
        make_tree(to);
        lo->mx = max((to->mx) + 1, lo->mx);
    }
    return;
}
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) {
    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 main() {
    scanf("%d", &n);
    for (int i = 1; i < n; i++) {
        int u, v;
        scanf("%d%d", &u, &v);
        tree[u].gra.push_back(v + tree);
        tree[v].gra.push_back(u + tree);
    }
    tree[1].depth = 1;
    make_tree(tree + 1);
    int m, x, y;
    scanf("%d%d%d", &m, &x, &y);
    long long out = 0;
    while (m--) {
        long long cans = ans(tree + x, tree + y);
        out ^= cans * cans;
        x = (x ^ cans + cans) % n + 1;
        y = (y ^ cans + cans) % n + 1;
    }
    cout << out;
    return 0;
}