#include <bits/stdc++.h>
using namespace std;
#define getc getchar
//char buf[1<<21],*p1=buf,*p2=buf,obuf[1<<21],*O=obuf;
//#define getc() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
inline long long read(){
    char c = getc() , f = 1;
    while (c < '0' || c > '9'){
        if (c == '-')f = -1;
        c = getc();
    }
    long long p = 0;
    while (c >= '0' && c <= '9'){
        p = p * 10 + c - '0';
        c = getc();
    }
    return p * f;
}
struct edge{int to , nxt;}e[1000005];
bool del[500005];
int head[500005] , cnt , n , ty , siz[500005] , mxsiz , rt , fa[500005] , f[500005][20] , dep[500005] , ans;
long long sum[500005];
inline void add(int u , int v){
    e[++cnt].to = v;
    e[cnt].nxt = head[u];
    head[u] = cnt;
}
struct node{
    vector <int> cnt;
    int min , mmin;
    node(){
        cnt.clear();
        min = mmin = 0x3f3f3f3f;
    }
    inline void insert(int x){
        cnt[x]++;
        if (x <= min){
            mmin = min;
            min = x;
        }else if (x < mmin)mmin = x;
    }
    inline void erase(int x){
        if (mmin == 0x3f3f3f3f)return;
        cnt[x]--;
        if (min == mmin && min == x && cnt[x] == 1){
            int sz = cnt.size();
            mmin++;
            while (mmin < sz && !cnt[mmin])mmin++;
            if (mmin == sz)mmin = 0x3f3f3f3f;
        }else if (min == x){
            int sz = cnt.size();
            while (min < sz && !cnt[min])min++;
            if (min == mmin && cnt[min] == 1){
                mmin++;
                while (mmin < sz && !cnt[mmin])mmin++;
                if (mmin == sz)mmin = 0x3f3f3f3f;
            }
        }else if (mmin == x && cnt[x] == 0){
             int sz = cnt.size();
            while (mmin < sz && !cnt[mmin])mmin++;
            if (mmin == sz)mmin = 0x3f3f3f3f;
        }
    }
    inline long long query(){
        if (mmin >= 0x3f3f3f3f)return 0;
        if (min == mmin)return 1ll * cnt[min] * (cnt[min] - 1) / 2;
        else return cnt[mmin];
    }
    inline int queru_min(){return min + mmin;}
}t[500005];
void dfs(int u , int fa){
    dep[u] = dep[fa] + 1;
    f[u][0] = fa;
    for (int i = 1;i <= 19;++i)f[u][i] = f[f[u][i - 1]][i - 1];
    for (int i = head[u];i;i = e[i].nxt){
        int to = e[i].to;
        if (to != fa)dfs(to , u);
    }
}
void dfs1(int u , int fa){
    int mx = 0;
    siz[u] = 1;
    for (int i = head[u];i;i = e[i].nxt){
        int to = e[i].to;
        if (to != fa && !del[to]){
            dfs1(to , u);
            siz[u] += siz[to];
            mx = max(mx , siz[to]);
        }
    }
    mx = max(mx , mxsiz - siz[u]);
    if (mx <= mxsiz / 2)rt = u;
}
inline int find_rt(int u , int siz){
    mxsiz = siz;
    dfs1(u , 0);
    return rt;
}
inline int lca(int x , int y){
    if (dep[x] < dep[y])swap(x , y);
    for (int i = 19;i >= 0;--i)
        if (dep[f[x][i]] >= dep[y])
            x = f[x][i];
    if (x == y)return x;
    for (int i = 19;i >= 0;--i){
        if (f[x][i] != f[y][i]){
            x = f[x][i];
            y = f[y][i];
        }
    }
    return f[x][0];
}
inline int dis(int u , int v){return dep[u] + dep[v] - 2 * dep[lca(u , v)];}
int solve(int u , int siz){
    u = find_rt(u , siz);
    del[u] = 1;
    t[u].cnt.resize(siz + 1);
    for (int i = head[u];i;i = e[i].nxt){
        int to = e[i].to;
        if (!del[to]){
            int sz = ::siz[to];
            if (sz > ::siz[u])sz = siz - ::siz[u];
            int v = solve(to , sz);
            fa[v] = u;
        }
    }
    return u;
}
signed main(){
    n = read() , ty = read();
    for (int i = 1;i < n;++i){
        int u = read() , v = read();
        add(u , v);
        add(v , u);
    }
    long long lans = 0;
    dfs(1 , 0);
    solve(1 , n);
    for (int i = 1;i <= n;++i){
        int u = i;
        while (u){
            t[u].insert(dis(u , i));
            u = fa[u];
        }
    }
    ans = 0x3f3f3f3f;
    for (int i = 1;i <= n;++i){
        int val = t[i].queru_min();
        ans = min(ans , val);
        if (val < 0x3f3f3f3f)sum[val] += t[i].query();
    }
    for (int _ = 1;_ <= n - 2;++_){
        long long u = read() ^ (lans * ty);
        int x = u;
        while (u){
            int val = t[u].queru_min();
            if (val < 0x3f3f3f3f)sum[val] -= t[u].query();
            t[u].erase(dis(u , x));
            val = t[u].queru_min();
            if (val < 0x3f3f3f3f)sum[val] += t[u].query();
            while (!sum[ans])ans++;
            u = fa[u];
        }
        printf ("%d %lld\n" , ans , sum[ans]);
        lans = sum[ans];
    }
    return 0;
}