#if defined(_USE_PCH_)
#include "pch.hpp"
#else
#include <bits/stdc++.h>
#endif
#define RNG(V_, A_, B_, ...) for(int V_=(A_), V_##_END=(B_) __VA_OPT__(,) __VA_ARGS__; V_<=V_##_END; V_++)
#define IRNG(V_, A_, B_, ...) for(int V_=(A_), V_##_END=(B_) __VA_OPT__(,) __VA_ARGS__; V_>=V_##_END; V_--)
#ifdef _WIN32
#define long int64_t
#endif
#define _UN using namespace
using namespace std;
const int MAXN=5e5+10; const int INF=1e9;
int n,tp,ans; long tot[MAXN],lstans;
vector<int> G[MAXN];
int dfn[MAXN],dfnc,st[20][MAXN],dep[MAXN];
int dfnmin(int u,int v){ return dfn[u]<dfn[v]?u:v; }
void dfs1(int u,int fa_){
    dfn[u]=++dfnc,st[0][dfnc]=fa_,dep[u]=dep[fa_]+1;
    for(int v:G[u]){
        if(v!=fa_) dfs1(v,u);
    }
}
int lca(int u,int v){
    if(u==v) return u;
    u=dfn[u],v=dfn[v];
    if(u>v) swap(u,v);
    u++; int t=__lg(v-u+1);
    return dfnmin(st[t][u],st[t][v-(1<<t)+1]);
}
int dist(int u,int v){ return dep[u]+dep[v]-2*dep[lca(u,v)]; }
namespace TD {
    bool vis[MAXN]; int siz[MAXN],cnt[MAXN],tfa[MAXN];
    void dfs1(int u,int fa,int totsz,pair<int,int>& rt){
        siz[u]=1;
        int mxsz=0;
        for(int v:G[u]){
            if(v!=fa&&!vis[v]) dfs1(v,u,totsz,rt),siz[u]+=siz[v],mxsz=max(mxsz,siz[v]);
        }
        mxsz=max(mxsz,totsz-siz[u]);
        rt=min(rt,pair<int,int>{mxsz,u});
    }
    void dfs2(int u,int fa,int d,int& mxd){
        mxd=max(mxd,d),cnt[d]++,siz[u]=1;
        for(int v:G[u]){
            if(v!=fa&&!vis[v]) dfs2(v,u,d+1,mxd),siz[u]+=siz[v];
        }
    }
    struct{
        int mxdep,mnp,scp,res; long resc; vector<int> buc;
        void upd(){
            while(mnp<=mxdep&&!buc[mnp]) mnp++;
            while(scp<=mxdep&&(!buc[scp]||scp<=mnp)) scp++;
            res=n+1,resc=0;
            if(mnp<=mxdep){
                if(buc[0]) res=mnp,resc=buc[mnp];
                else if(buc[mnp]>=2) res=mnp*2,resc=1l*buc[mnp]*(buc[mnp]-1)/2;
                else if(scp<=mxdep) res=mnp+scp,resc=buc[scp];
            }
        }
    } T[MAXN];
    void solve(int u){
        vis[u]=1;
        dfs2(u,0,0,T[u].mxdep);
        T[u].buc.resize(T[u].mxdep+1),copy_n(cnt,T[u].mxdep+1,T[u].buc.data());
        T[u].mnp=1,T[u].upd();
        tot[T[u].res]+=T[u].resc;
        fill_n(cnt,T[u].mxdep+1,0);
        for(int v:G[u]){
            if(vis[v]) continue;
            pair<int,int> rt{INF,0};
            dfs1(v,0,siz[v],rt);
            tfa[rt.second]=u;
            solve(rt.second);
        }
    }
    void init(){
        pair<int,int> rt{INF,0};
        dfs1(1,0,n,rt);
        solve(rt.second);
    }
    void upd(int r){
        for(int u=r; u; u=tfa[u]){
            tot[T[u].res]-=T[u].resc;
            T[u].buc[dist(u,r)]--;
            T[u].upd(),tot[T[u].res]+=T[u].resc;
        }
    }
};
int main(){
#if defined(_LOCAL_)
    freopen("in","r",stdin);
    freopen("out","w",stdout);
//  freopen("/dev/null","w",stderr);
#else
//  freopen("color.in","r",stdin);
//  freopen("color.out","w",stdout);
#endif
    ios::sync_with_stdio(false),cin.tie(nullptr),cout.tie(nullptr);
    cin>>n>>tp;
    RNG(_,1,n-1,u,v) cin>>u>>v,G[u].push_back(v),G[v].push_back(u);
    dfs1(1,0);
    RNG(t,1,__lg(n)){
        RNG(i,1,n-(1<<t)+1) st[t][i]=dfnmin(st[t-1][i],st[t-1][i+(1<<(t-1))]);
    }
    TD::init();
    RNG(_,1,n-2){
        long u_; int u; cin>>u_;
        if(tp) u=int(u_^lstans);
        else u=int(u_);
        TD::upd(u);
        while(!tot[ans]) ans++;
        cout<<ans<<" "<<(lstans=tot[ans])<<"\n";
    }
}