// just for test
// just for test
// just for test
// just for test
// just for test

#include<bits/stdc++.h>
#define Gc() getchar() 
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define eb emplace_back
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;using LL=__int128;
const int N=5e5+5,M=N*4+5,K=(1<<25)+5,mod=1e9+7,Mod=mod-1;const db eps=1e-9;const int INF=1e9+7;mt19937 rnd(time(0));
int n,tp,x,y;vector<int> S[N];
int Rt,Ct,vis[N],siz[N],dp[N],d[N];
void GI(int x,int La){
	siz[x]=1;for(int i:S[x]) if(i^La&&!vis[i]) GI(i,x),siz[x]+=siz[i];
}
void DP(int x,int La){
	dp[x]=Ct-siz[x];for(int i:S[x]) if(i^La&&!vis[i]) DP(i,x),dp[x]=max(siz[i],dp[x]);
	if(dp[x]<dp[Rt]) Rt=x;
}
int len[N];
void make(int x,int La,int id){
	d[x]=d[La]+1;len[id]=max(len[id],d[x]);
	for(int i:S[x]) if(i^La&&!vis[i]) make(i,x,id);
}
vector<int> G[N];vector<pair<int,int> > P[N];
void push(int x,int La,int id){
	G[id][d[x]]++;P[x].emplace_back(id,d[x]);
	for(int i:S[x]) if(i^La&&!vis[i]) push(i,x,id);
}
int p1[N],p2[N];
ll f[N];
void rollback(int x){
	if(p2[x]>len[x]) return;
	f[p1[x]+p2[x]]-=(p1[x]^p2[x]?1ll*(G[x][p1[x]]+1)*(G[x][p2[x]]+1):1ll*(G[x][p1[x]]+2)*(G[x][p1[x]]+1)/2);
	G[x][p1[x]]++;G[x][p2[x]]++;
}
void insert(int x){
	while(p1[x]<=len[x]&&!G[x][p1[x]]) p1[x]++;if(p1[x]<=len[x]) G[x][p1[x]]--;
	while(p2[x]<=len[x]&&!G[x][p2[x]]) p2[x]++;if(p2[x]<=len[x]) G[x][p2[x]]--;
	if(p2[x]<=len[x]) f[p1[x]+p2[x]]+=(p1[x]^p2[x]?1ll*(G[x][p1[x]]+1)*(G[x][p2[x]]+1):1ll*(G[x][p1[x]]+2)*(G[x][p1[x]]+1)/2);
	// cerr<<x<<' '<<p1[x]<<' '<<p2[x]<<'\n';
}
void dfs(int x){
	GI(x,0);Ct=siz[x];dp[Rt=0]=INF;DP(x,0);vis[x=Rt]=1;
	make(x,0,x);
	G[x].resize(len[x]+1);push(x,0,x);insert(x);
	for(int i:S[x]) if(!vis[i]) dfs(i);
}
void Solve(){
	int i,j;scanf("%d%d",&n,&tp);d[0]=-1;
	for(i=1;i<n;i++) {
		scanf("%d%d",&x,&y);
		S[x].emplace_back(y);S[y].emplace_back(x);
	}
	dfs(1);
	int ans=0;ll LA=0;
	for(i=1;i<=n-2;i++){
		int x;scanf("%d",&x);x^=LA*tp;
		for(auto j:P[x]) rollback(j.fi),G[j.fi][j.se]--,insert(j.fi);
		while(!f[ans]) ans++;
		printf("%d %lld\n",ans,LA=f[ans]);
	}
}
int main(){
	int t=1;
	// scanf("%d",&t);
	while(t--) Solve();
	// cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
	cout<<"fuck your mother"<<endl;
}