#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
using ll=long long;
const int N=5e5+5, inf=1e9+7;
int n, m, tp, tot, rt, sum, minn, cnt;
int val[N], h[N], sz[N], fa[N][20], dep[N], pos[N], lg[N<<1], ft[N], lw[N], lw2[N];
bool vis[N];
vector<int> C[N], nxt[N];
vector<int> e[N];
void dfs0(int u, int f) {
	pos[u]=cnt; fa[u][0]=f;
	for(int v:e[u])
		if(v^f)
			dep[v]=dep[u]+1, dfs0(v, u);
}
int lca(int x, int y) {
	if(dep[x]<dep[y]) swap(x, y);
	for(int i=19; ~i; i--) if(dep[fa[x][i]]>=dep[y]) x=fa[x][i];
	if(x==y) return x;
	for(int i=19; ~i; i--) 
		if(fa[x][i]!=fa[y][i]) x=fa[x][i], y=fa[y][i];
	return fa[x][0];;
}
int get_dis(int u, int v) {
	int l=lca(u, v);
	return dep[u]+dep[v]-2*dep[l];
}

void findrt(int u, int f) {
	sz[u]=1;
	int res=0;
	for(int v:e[u]) {
		if(f^v&&!vis[v]) {
			findrt(v, u);
			sz[u]+=sz[v];
			res=max(res, sz[v]);
		}
	}
	res=max(res, sum-sz[u]);
	if(res<minn) minn=res, rt=u;
}
int dth[N], mxd;
ll disw[N];
int mn=inf, ans=0;
void getdep(int u, int f, int rt) {

	C[rt][dth[u]]++;
	for(int v:e[u]) {
		if(v^f&&!vis[v]) {
			dth[v]=dth[u]+1;
			getdep(v, u, rt);
		}
	}
}
void calc(int u, int ty) {
	while(lw[u]<=sz[u]&&!C[u][lw[u]]) {
		lw[u]++;
	}
	if(lw[u]>sz[u]) return ;
	lw2[u]=max(lw2[u], lw[u]+1);
	while(lw2[u]<=sz[u]&&!C[u][lw2[u]]) {
		lw2[u]++;
	}
	
	if(C[u][lw[u]]>=2) {
		int mn=lw[u]+lw[u]; ll t=1ll*C[u][lw[u]]*(C[u][lw[u]]-1)/2;
		disw[mn]+=t*ty;
	} else {
		if(lw2[u]>sz[u]) return ;
		
		int mn=lw[u]+lw2[u]; ll t=1ll*C[u][lw[u]]*C[u][lw2[u]];
		disw[mn]+=t*ty;
	}
}
void dfs(int u) {
	dth[u]=0; C[u].resize(sum+2);
	getdep(u, 0, u);
	lw[u]=0; lw2[u]=1;
	calc(u, 1);
	
	vis[u]=1;
	sz[u]=sum+1;
	C[u].resize(sum+1);
	for(int v:e[u]) {
		if(!vis[v]) {
			sum=sz[v]; rt=0; minn=inf;
			findrt(v, 0);
			ft[rt]=u;
			dfs(rt);
		}
	}
}
void del(int u) {
	for(int i=u; i; i=ft[i]) calc(i, -1);
	for(int i=u; i; i=ft[i]) {
		C[i][get_dis(i, u)]--;
	}
	for(int i=u; i; i=ft[i]) calc(i, 1);
}


int main() {
	scanf("%d %d", &n, &tp);
	for(int i=1; i<n; i++) {
		int u, v;
		scanf("%d %d", &u, &v);
		e[u].push_back(v);
		e[v].push_back(u);
	}
	dfs0(1, 0);
	for(int i=1; i<=19; i++)
		for(int j=1; j<=n; j++)
			fa[j][i]=fa[fa[j][i-1]][i-1];
	sum=n, minn=inf;
	findrt(1, 0);
	dfs(rt);
	ll lstans=0; int ans=1;
	for(int i=1; i<=n-2; i++) {
		int x;
		scanf("%d", &x);
		x^=(lstans*tp);
		del(x);
		while(!disw[ans]) ans++;
		printf("%d %lld\n", ans, lstans=disw[ans]);
	}
	return 0;
}