#include <bits/stdc++.h>
using namespace std;
#define For(Ti,Ta,Tb) for(auto Ti=(Ta);Ti<=(Tb);++Ti)
#define Dec(Ti,Ta,Tb) for(auto Ti=(Ta);Ti>=(Tb);--Ti)
#define debug(...) fprintf(stderr,__VA_ARGS__)
#define range(Tx) begin(Tx),end(Tx)
using ll=long long;
const int N=5e5+5;
int n,tp,tfa[N],tdep[N],dis[20][N],p1[N],p2[N];
vector<int> e[N],deps[N];
int vis[N],siz[N],mxsiz[N];
void get_root(int u,int fa,int tot,int& rt){
	siz[u]=1;
	mxsiz[u]=0;
	for(int v:e[u]){
		if(v!=fa&&!vis[v]){
			get_root(v,u,tot,rt);
			siz[u]+=siz[v];
			mxsiz[u]=max(mxsiz[u],siz[v]);
		}
	}
	mxsiz[u]=max(mxsiz[u],tot-siz[u]);
	if(!rt||mxsiz[u]<mxsiz[rt]){
		rt=u;
	}
}
void dfs(int u,int fa,int rt,int d){
	if(int(deps[rt].size())<=d){
		deps[rt].resize(d+1);
	}
	++deps[rt][d];
	dis[tdep[rt]][u]=d;
	for(int v:e[u]){
		if(v!=fa&&!vis[v]){
			dfs(v,u,rt,d+1);
		}
	}
}
int solve(int u,int dep){
	int rt=0;
	get_root(u,0,siz[u],rt);
	rt=0;
	get_root(u,0,siz[u],rt);
	u=rt;
	tdep[u]=dep;
	vis[u]=1;
	dfs(u,0,u,0);
	for(int v:e[u]){
		if(!vis[v]){
			int x=solve(v,dep+1);
			tfa[x]=u;
		}
	}
	return u;
}
ll cnt[N];
void update(int u,int w){
	if(p2[u]<int(deps[u].size())){
		if(p1[u]==p2[u]){
			ll x=deps[u][p1[u]];
			cnt[p1[u]*2]+=w*x*(x-1)/2;
		}else{
			cnt[p1[u]+p2[u]]+=w*deps[u][p1[u]]*deps[u][p2[u]];
		}
	}
}
void recalc(int v){
	while(p1[v]<int(deps[v].size())&&!deps[v][p1[v]]){
		++p1[v];
	}
	p2[v]=max(p2[v],p1[v]);
	while(p2[v]<int(deps[v].size())&&((p1[v]==p2[v]&&deps[v][p1[v]]==1)||!deps[v][p2[v]])){
		++p2[v];
	}
}
int main(){
	cin.tie(nullptr)->sync_with_stdio(false);
	cin>>n>>tp;
	For(i,1,n-1){
		int u,v;
		cin>>u>>v;
		e[u].push_back(v);
		e[v].push_back(u);
	}
	solve(1,0);
	int ans=0;
	ll last=0;
	For(i,1,n){
		recalc(i);
		update(i,1);
	}
	For(i,1,n-2){
		ll u;
		cin>>u;
		if(tp) u^=last;
		for(int v=u;v;v=tfa[v]){
			update(v,-1);
			int d=dis[tdep[v]][u];
			--deps[v][d];
			recalc(v);
			update(v,1);
		}
		while(!cnt[ans]) ++ans;
		cout<<ans<<' '<<(last=cnt[ans])<<'\n';
	}
	return 0;
}