// #define _GLIBCXX_DEBUG
#include "bits/stdc++.h"
#undef DEBUG
#ifdef DEBUG
#include "PrettyDebug.hpp"
#else
#define debug(...) [](auto...){}(__VA_ARGS__)
#define debuga(...) [](auto...){}(__VA_ARGS__)
#endif
#define For(i,a,b) for(int i=a;i<=b;i++)
#define Rev(i,a,b) for(int i=a;i>=b;i--)
#define Fin(file) freopen(file,"r",stdin)
#define Fout(file) freopen(file,"w",stdout)
using namespace std; typedef long long ll;
constexpr int N=5e5+5;
struct Cluster{
    enum { NIL, COMPRESS, RAKE } type=NIL;
    int x=0,y=0; // x up, y down
    int len=0,disx=0,disy=0,dis=0; ll cntx=0,cnty=0,cnt=0;
};
int n,type,siz[N],son[N],lc[N*4],rc[N*4],fa[N*4]; vector<int> to[N]; Cluster O[N*4]; int tot,Root;
inline void getmin(int& x,ll& c,int x1,ll c1,int x2,ll c2){
    if(x1<x2) x=x1,c=c1;
    else if(x2<x1) x=x2,c=c2;
    else x=x1,c=c1+c2;
}
Cluster Compress(const Cluster& A,const Cluster& B){
    assert(A.y==B.x);
    Cluster res; res.type=Cluster::COMPRESS; res.x=A.x; res.y=B.y;
    res.len=A.len+B.len;
    getmin(res.disx, res.cntx, A.disx, A.cntx, A.len+B.disx, B.cntx);
    getmin(res.disy, res.cnty, B.disy, B.cnty, B.len+A.disy, A.cnty);
    getmin(res.dis, res.cnt, A.dis, A.cnt, B.dis, B.cnt);
    getmin(res.dis, res.cnt, res.dis, res.cnt, A.disy+B.disx, A.cnty*B.cntx);
    return res;
}
Cluster Rake(const Cluster& A,const Cluster& B){
    assert(A.x==B.x);
    Cluster res; res.type=Cluster::RAKE; res.x=A.x; res.y=A.y;
    res.len=A.len;
    getmin(res.disx, res.cntx, A.disx, A.cntx, B.disx, B.cntx);
    getmin(res.disy, res.cnty, A.disy, A.cnty, A.len+B.disx, B.cntx);
    getmin(res.dis, res.cnt, A.dis, A.cnt, B.dis, B.cnt);
    getmin(res.dis, res.cnt, res.dis, res.cnt, A.disx+B.disx, A.cntx*B.cntx);
    return res;
}
void dfs0(int u,int pa){
    siz[u]=1; O[u]=Cluster{.type=Cluster::NIL, .x=pa, .y=u, .len=1, .disx=1, .disy=0, .dis=int(1e9), .cntx=1, .cnty=1, .cnt=0};
    if(pa) to[u].erase(find(to[u].begin(),to[u].end(),pa));
    for(int v:to[u]){
        dfs0(v,u); siz[u]+=siz[v]; if(siz[v]>siz[son[u]]) son[u]=v;
    }
}
int Bundle(vector<pair<int,int>>::iterator L,vector<pair<int,int>>::iterator R,function<Cluster(const Cluster&,const Cluster&)> func){
    if(L+1==R) return L->second;
    auto Mid=lower_bound(L,R,make_pair((L->first+prev(R)->first+1)/2,0)); if(Mid==L) Mid++;
    assert(Mid!=L&&Mid!=R);
    int u=Bundle(L,Mid,func),v=Bundle(Mid,R,func);
    O[++tot]=func(O[u],O[v]); lc[tot]=u; rc[tot]=v; fa[u]=fa[v]=tot; assert(tot<N*4); return tot;
}
int dfs(int u){
    vector<pair<int,int>> lis; lis.emplace_back(1,u);
    for(int v=u;son[v];v=son[v]){
        vector<pair<int,int>> tmp; tmp.emplace_back(1,son[v]);
        for(int w:to[v]) if(w!=son[v]) tmp.emplace_back(tmp.back().first+siz[w],dfs(w));
        debug(tmp);
        lis.emplace_back(lis.back().first+siz[v]-siz[son[v]],Bundle(tmp.begin(),tmp.end(),Rake));
    }
    debug(lis);
    return Bundle(lis.begin(),lis.end(),Compress);
}
signed main(){
    // Fin("25.in"); Fout("hh.out");
    atexit([](){cerr<<"Time = "<<clock()<<" ms"<<endl;}); ios::sync_with_stdio(0); cin.tie(0);
    cin>>n>>type; For(i,1,n-1) { int x,y; cin>>x>>y; to[x].push_back(y); to[y].push_back(x); }
    dfs0(1,0); tot=n; Root=dfs(1);
    ll ans=0;
    For(_,1,n-2){
        ll u; cin>>u; if(type) u^=ans;
        O[u].disx=O[u].disy=O[u].dis=1e9; O[u].cntx=O[u].cnty=O[u].cnt=0;
        for(u=fa[u];u;u=fa[u]) O[u]=(O[u].type==Cluster::COMPRESS?Compress:Rake)(O[lc[u]],O[rc[u]]);
        cout<<O[Root].dis<<' '<<(ans=O[Root].cnt)<<'\n';
    }
    return 0;
}

// START TYPING IF YOU DON'T KNOW WHAT TO DO
// STOP TYPING IF YOU DON'T KNOW WHAT YOU'RE DOING
// CONTINUE, NON-STOPPING, FOR CHARLIEVINNIE

// Started Coding On: November 23 Thu, 19 : 07 : 19