#include <iostream>

#include <cstdio>

using namespace std;

const int N = ;

int n, m, a, b, x, y, z;

int u, v;

int tot;

int f[N], depth[N], fa[][N], g[N];

int head[N], nxt[N<<], to[N<<];

int find(int x) {

    return x==f[x]?x:f[x]=find(f[x]);

}

void dfs(int u, int pre, int d) {

    fa[][u] = pre;

    depth[u] = d;

    int cnt = ;

    for(int i = head[u]; ~i; i = nxt[i]) {

        if(to[i] != pre) dfs(to[i], u, d+);

        cnt++;

    }

    g[u] =cnt;

}

int main() {

    while(~scanf("%d%d%d%d%d%d", &n, &m, &a, &b, &x, &y)) {

        tot = z = ;

        for(int i = ; i <= n; i++) f[i] = i, head[i] = -;

        for(int i = ; i < n-; i++) {

            scanf("%d%d", &u, &v);

            to[++tot] = v; nxt[tot] = head[u]; head[u] = tot;

            to[++tot] = u; nxt[tot] = head[v]; head[v] = tot;

        }

        dfs(, , );

        for(int i = ; i < ; i++)

            for(int j = ; j < n; j++)

                fa[i+][j] = fa[i][fa[i][j]];

        for(int i = ; i < n; i++) z ^= g[i];

        while(m--) {

            u = (a*x+b*y+z)%n;

            v = (a*y+b*x+z)%n;

            x = u; y = v;

            if(depth[u]<depth[v]) swap(u, v);

            int dep = depth[u]-depth[v];

            if(dep>) {

                for(int i = ; i >= ; i--) {

                    if(dep&(<<i)) u = fa[i][u];

                }

            }

            for(int i = ; i >= ; i--) {

                if(fa[i][u] != fa[i][v]) {

                    u = fa[i][u];

                    v = fa[i][v];

                }

            }

            if(u!=v) v = fa[][v];

            u = find(x);

            while(depth[fa[][u]]>depth[v]) {

                z ^= g[fa[][u]];

                g[fa[][u]]--;

                z ^= g[fa[][u]];

                f[u] = fa[][u];

                u = find(u);

            }

        }

        printf("%d %d\n", x, y);

    }

}