#include<bits/stdc++.h>

using namespace std;

void read(int &x){
    x = 0;
    char c = getchar();
    while(c < '0' || c > '9') c = getchar();
    while('0' <= c && c <= '9'){
        x = x*10+c-'0';
        c = getchar();
    }
}

void readll(long long &x){
    x = 0;
    char c = getchar();
    while(c < '0' || c > '9') c = getchar();
    while('0' <= c && c <= '9'){
        x = x*10+c-'0';
        c = getchar();
    }
}

void write(long long x){
    if(x > 9) write(x/10);
    putchar(x%10+'0');
}

const int N = 5e5 + 5, M = 2*N+1;

int n;
int he[N], ne[M], to[M], ecnt;

void add(int x, int y){
    ne[++ecnt] = he[x];
    he[x] = ecnt;
    to[ecnt] = y;
}

bool vis[N];
int siz[N], lmt;
int sf[N];
unordered_map<int, int> mp[N];

void gsiz(int x, int fa){
    siz[x] = 1;
    for(int i = he[x]; i; i = ne[i]){
        int j = to[i];
        if(j != fa && !vis[j]){
            gsiz(j, x);
            siz[x] += siz[j];
        }
    }
}

int groot(int x, int fa){
    for(int i = he[x]; i; i = ne[i]){
        int j = to[i];
        if(j != fa && !vis[j]){
            if(siz[j] > lmt){
                return groot(j, x);
            }
        }
    }
    return x;
}

int grt(int x){
    gsiz(x, 0);
    lmt = siz[x]/2;
    return groot(x, 0);
}

vector<int> tong[N];

void dfs(int x, int fa, int dis, int jl){
    mp[x][jl] = dis;
    tong[jl][dis]++;
    for(int i = he[x]; i; i = ne[i]){
        int j = to[i];
        if(j != fa && !vis[j]){
            dfs(j, x, dis+1, jl);
        }
    }
}

int p1[N], p2[N];
int fminn[N];
long long fcnt[N];
long long zcnt[N];
int nwminn;
long long nwcnt;

void doit(){
    // while(nwminn <= 100 && zcnt[nwminn] == 0){
    while(zcnt[nwminn] == 0){
        nwminn++;
    }
}

void gongx(int x, int k){
    zcnt[fminn[x]] += fcnt[x] * k;
}

void tz(int x){
    gongx(x, -1);
    while(p1[x] < siz[x] && p2[x] < siz[x]){
        if(p1[x] == p2[x]){
            if(tong[x][p1[x]] >= 2){
                break;
            }else{
                p2[x]++;
            }
        }else{
            if(!tong[x][p2[x]]){
                p2[x]++;
            }else{
                if(!tong[x][p1[x]]){
                    p1[x]++;
                }else{
                    break;
                }
            }
        }
    }
    if(p2[x] == siz[x]){
        fminn[x] = n+1;
        fcnt[x] = 0;
    }else{
        fminn[x] = p1[x]+p2[x];
        if(p1[x] == p2[x]){
            fcnt[x] = tong[x][p1[x]]*(tong[x][p1[x]]-1ll)/2;
        }else{
            fcnt[x] = (long long)tong[x][p1[x]] * tong[x][p2[x]];
        }
    }
    gongx(x, 1);
}

void solve(int x){
    // printf("solve(%d);\n", x);
    vis[x] = 1;
    gsiz(x, 0);
    tong[x].resize(siz[x]);
    dfs(x, 0, 0, x);
    // puts("a");
    tz(x);
    // puts("b");
    for(int i = he[x]; i; i = ne[i]){
        int j = to[i];
        if(!vis[j]){
            int k = grt(j);
            sf[k] = x;
            solve(k);
        }
    }
}

void change(int x){
    int p = x;
    while(p){
        tong[p][mp[x][p]]--;
        tz(p);
        p = sf[p];
    }
}

int main(){

    // freopen("btq.in", "r", stdin);
    // freopen("btq.out", "w", stdout);
    
    int zx = 0;
    read(n); read(zx);
    for(int i = 1, x = 0, y = 0; i < n; i++){
        read(x); read(y);
        add(x, y);
        add(y, x);
    }

    solve(grt(1));
    doit();
    // for(int i = 0; i <= n; i++){
    //     printf("zcnt[%d]: %lld\n", i, zcnt[i]);
    // }

    // write(nwminn);
    // putchar(' ');
    // write(zcnt[nwminn]);
    // putchar('\n');
    // return 0;

    // for(int i = 1; i <= n; i++){
        // int tp = val[i];
        // val[i] = 0;
        // change(i, tp);
    // }

    long long lt = 0;
    long long x = 0;
    for(int i = 1; i <= n-2; i++){
        readll(x);
        x ^= (lt*zx);
        change(x);
        doit();
        write(nwminn);
        putchar(' ');
        write(lt=zcnt[nwminn]);
        putchar('\n');
        // return 0;
    }

    return 0;
}