#include<bits/stdc++.h>
#define ll long long
#define pii pair<int,int>
#define fi first
#define se second
#define pb push_back
#define mp make_pair
using namespace std;
const int inf=1e9;
ll ct[500050];
int n,tt,tt1,mark[1005000],dis[1005000][21],up[1005000][21],col[1005000][21],dep[1005000];
int mn[1005000];ll Ct[1005000];
vector<int>road[505000],vec[2][1005000];
vector<pii>Road[1005000];
void add(int u,int v,int w){Road[u].pb(mp(v,w)),Road[v].pb(mp(u,w));}
void dfs(int u,int fa){
	int lst=-1;
	for(int v:road[u]){
		if(v==fa)continue;dfs(v,u);
		if(lst==-1){add(u,v,1);continue;}
		int id=++tt;add(lst,id,0),add(id,v,1),lst=id;
	}
}
void dfs1(int u,int fa){
	for(auto v:Road[u]){
		if(v.fi==fa)continue;
		dep[v.fi]=dep[u]+1;
		dfs1(v.fi,u);
	}
}
bool chk(int u,int v){
	if(dep[u]<dep[v])swap(u,v);
	return mark[u];
}
int sz[1000005],mx[1000005],rt,rt1;
void find(int u,int fa,int ct1){
	sz[u]=1,mx[u]=0;
	for(auto v:Road[u]){
		if(v.fi==fa||chk(u,v.fi))continue;
		find(v.fi,u,ct1),sz[u]+=sz[v.fi];
	}mx[u]=max(ct1-sz[u],sz[u]);
	if(rt==-1||mx[u]<mx[rt])rt=u,rt1=fa;
}
int Mx[2],ctt[2][1005005],Now[1005005][2];
void init(int u,int fa,int cl,int dp,int id){
	up[u][dp]=id,col[u][dp]=cl,Mx[cl]=max(Mx[cl],dis[u][dp]),sz[u]=1;
	if(u<=n)++ctt[cl][dis[u][dp]];
	for(auto v:Road[u]){
		if(v.fi==fa||chk(u,v.fi))continue;
		dis[v.fi][dp]=dis[u][dp]+v.se;
		init(v.fi,u,cl,dp,id),sz[u]+=sz[v.fi];
	}
}
void solve(int u,int G,int dp){
	if(G<2)return;int p,q,s1,s2;
	rt=-1;find(u,-1,G),p=rt,q=rt1;
	assert(rt1>0);
    if(dep[p]<dep[q])swap(p,q);
    mark[p]=1,++tt1,Mx[0]=Mx[1]=0,dis[p][dp]=dis[q][dp]=0;
    init(p,-1,0,dp,tt1),init(q,-1,1,dp,tt1),s1=sz[p],s2=sz[q];
    mn[tt1]=0,Ct[tt1]=1;
    for(int i=0;i<2;++i){
    	vec[i][tt1].resize(Mx[i]+1);
    	for(int j=0;j<=Mx[i];++j)vec[i][tt1][j]=ctt[i][j],ctt[i][j]=0;
    	Now[tt1][i]=0;
    	while(Now[tt1][i]<=Mx[i]&&!vec[i][tt1][Now[tt1][i]])++Now[tt1][i];
    	if(Now[tt1][i]==Mx[i])mn[tt1]+=inf;
    	else mn[tt1]+=Now[tt1][i],Ct[tt1]*=1ll*vec[i][tt1][Now[tt1][i]];
	}
	if(mn[tt1]<=n)ct[mn[tt1]]+=Ct[tt1];
	solve(p,s1,dp+1),solve(q,s2,dp+1);
}
void upd(int p){
	if(mn[p]>n)return;
	ct[mn[p]]-=Ct[p],mn[p]=1,Ct[p]=1;
	for(int i=0;i<2;++i){
		while(Now[p][i]<vec[i][p].size()&&!vec[i][p][Now[p][i]])++Now[p][i];
		if(Now[p][i]==vec[i][p].size())mn[p]+=inf;
		else mn[p]+=Now[p][i],Ct[p]*=1ll*vec[i][p][Now[p][i]];
	}
	if(mn[p]<=n)ct[mn[p]]+=Ct[p];
}
void del(int p){
	for(int i=0;i<=20;++i){
		if(!up[p][i])continue;
		--vec[col[p][i]][up[p][i]][dis[p][i]],upd(up[p][i]);
	}
}
int Ans,tp;
ll lstans;
int main(){
	scanf("%d%d",&n,&tp),tt=n;
	for(int i=1;i<n;++i){
		int u,v;scanf("%d%d",&u,&v);
		road[u].pb(v),road[v].pb(u);
	}dfs(1,-1),dfs1(1,-1);
	solve(1,tt,0);
	int q=n-2;Ans=1;
	while(q--){
		ll x;scanf("%lld",&x);
		x^=(tp*lstans),del(x);
		while(!ct[Ans])++Ans;
		printf("%d %lld\n",Ans,ct[Ans]),lstans=ct[Ans];
	}
	return 0;
}