#include<iostream>
#include<cstdio>
#include<vector>
#include<map>
#define N 1000000
#define M 19
using namespace std;
const int inf=(int)(1e9);
long long read()
{
	char c=0;
	long long sum=0;
	while (c<'0'||c>'9') c=getchar();
	while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
	return sum;
}
int n,rt,type,smz,sz[N+1],szt[N+1],maxp[N+1],depth[N+1],dis[N+1][M+1],fa[N+1],ps;
long long ans,delta[N+1],cnt[N+1];
vector<int>E[N+1];
bool used[N+1],vis[N+1];
map<int,int>P[N+1];
void add(int x,int y)
{
	E[x].push_back(y),E[y].push_back(x);
	return;
}
void get_rt(int x)
{
	vis[x]=sz[x]=1,maxp[x]=0;
	for (int i=0;i<E[x].size();++i)
		if (!used[E[x][i]]&&!vis[E[x][i]])
			get_rt(E[x][i]),sz[x]+=sz[E[x][i]],maxp[x]=max(maxp[x],sz[E[x][i]]);
	maxp[x]=max(maxp[x],smz-sz[x]);
	if (maxp[x]<maxp[rt]) rt=x;
	vis[x]=0;
	return;
}
void dfs(int x,int d)
{
	vis[x]=szt[x]=1;
	for (int i=0;i<E[x].size();++i)
		if (!used[E[x][i]]&&!vis[E[x][i]])
			dis[E[x][i]][d]=dis[x][d]+1,dfs(E[x][i],d),szt[x]+=szt[E[x][i]];
	vis[x]=0;
	return;
}
void solve(int x)
{
	dfs(x,depth[x]),used[x]=1;
	for (int i=0;i<E[x].size();++i)
		if (!used[E[x][i]])
			rt=0,smz=szt[E[x][i]],get_rt(E[x][i]),fa[rt]=x,depth[rt]=depth[x]+1,solve(rt);
	return;
}
void adder(int x,int d)
{
	int ds;
	if (!P[x].empty())
	{
		auto it=P[x].begin();
		if ((*it).second>=2) cnt[(*it).first<<1]+=(((*it).second*((*it).second-1))>>1)*d;
		else if (P[x].size()>=2) ds=(*it).first,it++,cnt[ds+(*it).first]+=d*(*it).second;
	}
	return;
}
int main()
{
	long long x,y;
	n=read(),type=read(),ps=1,maxp[0]=inf;
	for (int i=1;i<=n-1;++i) x=read(),y=read(),add(x,y);
	smz=n,get_rt(1),depth[rt]=1,solve(rt);
	for (int i=1;i<=n;++i)
	{
		x=i;
		for (int j=depth[i];j>=1;--j) P[x][dis[i][j]]++,x=fa[x];
	}
	for (int i=1;i<=n;++i) adder(i,1);
	for (int i=1;i<=n-2;++i)
	{
		y=x=read()^(type*ans);
		for (int j=depth[x];j>=1;--j)
		{
			adder(y,-1),P[y][dis[x][j]]--;
			if (!P[y][dis[x][j]]) P[y].erase(dis[x][j]);
			adder(y,1),y=fa[y];
		}
		while (!cnt[ps]) ps++;
		printf("%d %lld\n",ps,cnt[ps]),ans=cnt[ps];
	}
	return 0;
}