#include<bits/stdc++.h>
#define poly vector<int>
#define IOS ios::sync_with_stdio(false)
#define ll long long
#define mp make_pair
#define mt make_tuple
#define pa pair < int,int >
#define fi first
#define se second
#define inf 1e18
#define mod 998244353
#define sz(x) ((int)((x).size()))
#define int ll
// #define N 
using namespace std;
const int N=500005;
int n,c;
int dep[N],dfn[N],DFN;
int vis[N];
int st[N][20];
poly all[N];
int fffa[N];
int mx[N],smx[N];
int ffa[N];
int Mp[N];
int siz[N];
poly G[N];
int ds[N];
inline int cmn(int x,int y)
{
    return (dep[x]<dep[y]?x:y);
}
inline int lca(int x,int y)
{
    if (x==y) return x;
    if (dfn[x]>dfn[y]) swap(x,y);
    x=dfn[x]+1,y=dfn[y];
    int t=__lg(y-x+1);
    return fffa[cmn(st[x][t],st[y-(1<<t)+1][t])];
}
inline int dis(int x,int y)
{
    // cout<<x<<" "<<y<<" "<<lca(x,y)<<endl;
    return dep[x]+dep[y]-2*dep[lca(x,y)];
}
void dfs2(int k,int fa)
{
    fffa[k]=fa;
    dep[k]=dep[fa]+1;
    dfn[k]=++DFN;
    st[DFN][0]=k;
    for (auto u:G[k])
    {
        if (u==fa) continue;
        dfs2(u,k);
    }
}
void dfs(int k,int fa)
{
    siz[k]=1;
    for (auto u:G[k])
    {
        if (vis[u]||u==fa) continue;
        dfs(u,k);
        siz[k]+=siz[u];
    }
}
void dfs1(int k,int fa,int all,int &rt)
{
    int mx=0;
    for (auto u:G[k])
    {
        if (vis[u]||u==fa) continue;
        dfs1(u,k,all,rt);
        mx=max(mx,siz[u]);
    }
    mx=max(mx,all-siz[k]);
    if (mx*2<=all) rt=k;
}
void dfs3(int k,int fa,int rt)
{
    while (ds[k]>=sz(all[rt])) all[rt].push_back(0);
    all[rt][ds[k]]++;
    for (auto u:G[k])
    {
        if (vis[u]||u==fa) continue;
        ds[u]=ds[k]+1;
        dfs3(u,k,rt);
    }
}
void chkmx(int k)
{
    while (mx[k]<all[k].size()&&!all[k][mx[k]])
    {
        mx[k]++;
    }
    if (mx[k]==sz(all[k]))
    {
        smx[k]=sz(all[k]);
        return;
    }
    smx[k]=max(smx[k],mx[k]);
    while (smx[k]==mx[k]&&all[k][mx[k]]==1||smx[k]<sz(all[k])&&!all[k][smx[k]])
    {
        smx[k]++;
    }
}
int work(int k)
{
    // cout<<"??"<<k<<endl;
    dfs(k,0);
    int rt;
    dfs1(k,0,siz[k],rt);
    vis[rt]=1;
    ds[rt]=0;all[rt]=poly(1,1);
    for (auto u:G[rt])
    {
        if (vis[u]) continue;
        ds[u]=ds[rt]+1;
        dfs3(u,rt,rt);
    }
    chkmx(rt);
    if (mx[rt]<sz(all[rt])&&smx[rt]<sz(all[rt]))
    {
        int coef=0;
        if (mx[rt]==smx[rt]) coef=all[rt][mx[rt]]*(all[rt][mx[rt]]-1)/2;
        else coef=all[rt][smx[rt]];
        Mp[mx[rt]+smx[rt]]+=coef;
    }
    for (auto u:G[rt])
    {
        if (vis[u]) continue;
        int op=work(u);
        ffa[op]=rt;
    }
    return rt;
}
void ers(int x,int k)
{
    if (!k) return;
    // cout<<x<<" "<<k<<" "<<dis(x,k)<<endl;
    if (mx[k]<sz(all[k])&&smx[k]<sz(all[k]))
    {
        int coef=0;
        if (mx[k]==smx[k]) coef=all[k][mx[k]]*(all[k][mx[k]]-1)/2;
        else coef=all[k][smx[k]];
        Mp[mx[k]+smx[k]]-=coef;
    }
    all[k][dis(x,k)]--;
    chkmx(k);
    if (mx[k]<sz(all[k])&&smx[k]<sz(all[k]))
    {
        int coef=0;
        if (mx[k]==smx[k]) coef=all[k][mx[k]]*(all[k][mx[k]]-1)/2;
        else coef=all[k][smx[k]];
        Mp[mx[k]+smx[k]]+=coef;
    }  
    ers(x,ffa[k]);
}
void BellaKira()
{
    cin>>n>>c;
    for (int i=1;i<n;i++)
    {
        int x,y;
        cin>>x>>y;
        G[x].push_back(y);
        G[y].push_back(x);
    }
    dfs2(1,0);
    for (int j=1;j<20;j++)
        for (int i=1;i+(1<<j)-1<=n;i++)
            st[i][j]=cmn(st[i][j-1],st[i+(1<<(j-1))][j-1]);
    work(1);
    // return;
    int ans=0;
    int lst=0;
    while (!Mp[ans]) ans++;
    // cout<<"???"<<ans<<" "<<Mp[ans]<<endl;
    // return;
    for (int i=1;i<=n-2;i++)
    {
        int x;
        cin>>x;
        x=x^(lst*c);
        ers(x,x);
        while (!Mp[ans]) ans++;
        cout<<ans<<" "<<Mp[ans]<<'\n';
        lst=Mp[ans];
    }
}
signed main()
{
    // freopen("B.in","r",stdin);
    IOS;
    cin.tie(0);
    int T=1;
    while (T--)
    {
        BellaKira();
    }
}
/*list:
1.mod 998244353 or 1e9+7 or ???
2.N
3.duipai shuju xingtai duoyidian
...
*/