#include <bits/stdc++.h>
#define ll long long
#define fi first
#define se second
#define mkp make_pair
#define pir pair <ll, ll>
#define pb emplace_back
#define i128 __int128
using namespace std;
template <class T>
void rd(T &x) {
	char ch; ll f = 0;
	while(!isdigit(ch = getchar()))
		if(ch == '-') f = 1;
	x = ch - '0';
	while(isdigit(ch = getchar()))
		x = (x << 1) + (x << 3) + ch - '0';
	if(f) x = -x;
}
const ll maxn = 2e5 + 10, inf = 1e18;
ll n, ttc;
vector <ll> to[maxn];
ll mndist[maxn], cnt[maxn];
namespace LCA {
	ll dep[maxn], d[maxn][20];
	void dfs(ll u, ll fa = 0) {
		dep[u] = dep[fa] + 1, d[u][0] = fa;
		for(ll i = 1; i < 20; i++)
			d[u][i] = d[d[u][i - 1]][i - 1];
		for(ll v: to[u])
			if(v ^ fa) dfs(v, u);
	}
	ll lca(ll u, ll v) {
		if(dep[u] < dep[v]) swap(u, v);
		ll t = dep[u] - dep[v];
		for(ll i = 0; i < 20; i++)
			if(t & (1 << i)) u = d[u][i];
		if(u == v) return u;
		for(ll i = 19; ~i; i--)
			if(d[u][i] ^ d[v][i])
				u = d[u][i], v = d[v][i];
		return d[u][0];
	}
	ll dist(ll u, ll v) { return dep[u] + dep[v] - 2 * dep[lca(u, v)]; }
} using LCA::dist;
ll siz[maxn], vis[maxn], bs, crt, tfa[maxn];
vector <ll> bin[maxn]; ll p[maxn], q[maxn];
ll ans, cg, totalbin[maxn];
namespace centroid_divide {
	void findrt(ll u, ll N, ll fa = 0) {
		siz[u] = 1; ll mx = 0;
		for(ll v: to[u])
			if(!vis[v] && v != fa) {
				findrt(v, N, u);
				siz[u] += siz[v], mx = max(mx, siz[v]);
			} mx = max(mx, N - siz[u]);
		if(mx < bs) bs = mx, crt = u;
	} ll o;
	void getsiz(ll u, ll dep = 0, ll fa = 0) {
		siz[u] = 1, ++bin[o][dep];
		for(ll v: to[u])
			if(!vis[v] && v != fa) {
				getsiz(v, dep + 1, u);
				siz[u] += siz[v];
			}
	}
	ll build(ll u, ll N) {
		bs = inf, findrt(u, N);
		vis[u = crt] = 1, bin[u].resize(N);
		getsiz(o = u);
		p[u] = 0, q[u] = 1;
		if(N > 1) totalbin[1] += bin[u][1];
		for(ll v: to[u])
			if(!vis[v]) tfa[build(v, siz[v])] = u;
		return u;
	}
}
ll calc(ll x, ll y, ll z) {
	if(y < z) return bin[x][y] * bin[x][z];
	return bin[x][y] * (bin[x][y] - 1) / 2;
}
void del(ll u) {
	for(ll x = u; x; x = tfa[x]) {
		ll tmp = dist(x, u);
		if(q[x] < siz[x]) totalbin[p[x] + q[x]] -= calc(x, p[x], q[x]);
		--bin[x][tmp];
		while(p[x] < siz[x] && !bin[x][p[x]]) ++p[x];
		while(q[x] < siz[x] && (!bin[x][q[x]] ||
		 q[x] < p[x] || q[x] == p[x] && bin[x][p[x]] == 1)) ++q[x];
		if(q[x] < siz[x]) totalbin[p[x] + q[x]] += calc(x, p[x], q[x]);
	}
}
int main() {
	rd(n), rd(ttc);
	for(ll i = 1; i < n; i++) {
		ll u, v; rd(u), rd(v);
		to[u].pb(v), to[v].pb(u);
	} LCA::dfs(1);
	centroid_divide::build(1, n);
	for(ll _ = 1; _ < n - 1; _++) {
		ll u; rd(u);
		u ^= ttc * cg;
		del(u);
		while(!totalbin[ans]) ++ans;
		printf("%lld %lld\n", ans, cg = totalbin[ans]);
	}
	return 0;
}