#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n, tp;
struct Edge {
	int v, nxt;
} e[1000005];
int head[500005], len;
void Insert(int u, int v) {
	e[++len] = { v, head[u] };
	head[u] = len;
}
struct Dat {
	ll x, y;
	Dat &operator+=(const Dat &b) {
		if (x < b.x) return *this;
		if (x > b.x) return *this = b;
		y += b.y;
		return *this;
	}
	Dat operator+(const Dat &b) const {
		Dat res = *this;
		return res += b;
	}
	Dat operator*(const Dat &b) const {
		return { x + b.x, y * b.y };
	}
	Dat Mov(ll d) const { return { x + d, y }; }
};
enum Type {
	NIL, RAKE, COMPRESS
};
struct Cluster {
	Dat dx, dy, d;
	Type tp;
	int x, y, len;
} f[1000005];
int cnt;
Cluster Rake(const Cluster &a, const Cluster &b) {
	Cluster res;
	res.tp = RAKE;
	res.x = a.x, res.y = a.y;
	res.dx = a.dx + b.dx;
	res.dy = a.dy + b.dx.Mov(a.len);
	res.d = a.d + b.d + a.dx * b.dx;
	res.len = a.len;
	return res;
}
Cluster Compress(const Cluster &a, const Cluster &b) {
	Cluster res;
	res.tp = COMPRESS;
	res.x = a.x, res.y = b.y;
	res.dx = a.dx + b.dx.Mov(a.len);
	res.dy = b.dy + a.dy.Mov(b.len);
	res.d = a.d + b.d + a.dy * b.dx;
	res.len = a.len + b.len;
	return res;
}
int siz[500005], hsn[500005];
void DFS1(int u, int fa) {
	siz[u] = 1;
	f[u].tp = NIL;
	f[u].len = 1, f[u].x = fa, f[u].y = u;
	f[u].d = { (int)1e9, 0 }, f[u].dx = { 1, 1 }, f[u].dy = { 0, 1 };
	for (int i = head[u]; i; i = e[i].nxt) {
		int v = e[i].v;
		if (v == fa) continue;
		DFS1(v, u);
		siz[u] += siz[v];
		if (siz[v] > siz[hsn[u]]) hsn[u] = v;
	}
}
typedef vector<pair<int, int>> V;
int ls[1000005], rs[1000005], prt[1000005];
int Div(V::iterator L, V::iterator R, Cluster (*F)(const Cluster &, const Cluster &)) {
	if (L + 1 == R) return L->second;
	auto M = lower_bound(L, R, make_pair((L->first + prev(R)->first + 1) / 2, 0));
	if (M == L) M++;
	int x = Div(L, M, F), y = Div(M, R, F), p = ++cnt;
	ls[p] = x, rs[p] = y, f[p] = F(f[x], f[y]);
	prt[x] = prt[y] = p;
	return p;
}
int DFS2(int u, int fa) {
	V li; li.push_back({ 1, u });
	for (int v = u, w = fa; hsn[v]; w = v, v = hsn[v]) {
		V t; t.push_back({ 1, hsn[v] });
		for (int i = head[v]; i; i = e[i].nxt) {
			int x = e[i].v;
			if (x == w || x == hsn[v]) continue;
			t.push_back({ t.back().first + siz[x], DFS2(x, v) });
		}
		li.push_back({ li.back().first + siz[v] - siz[hsn[v]], Div(t.begin(), t.end(), Rake) });
	}
	return Div(li.begin(), li.end(), Compress);
}
int rt;
int main() {
	scanf("%d%d", &n, &tp), cnt = n;
	for (int i = 1, u, v; i < n; i++) {
		scanf("%d%d", &u, &v);
		Insert(u, v), Insert(v, u);
	}
	DFS1(1, 0), rt = DFS2(1, 0);
	ll las = 0;
	for (int i = 1; i <= n - 2; i++) {
		ll x; scanf("%lld", &x); x ^= (tp * las);
		f[x].d = f[x].dx = f[x].dy = { (int)1e9, 0 };
		for (int u = prt[x]; u; u = prt[u]) f[u] = (f[u].tp == COMPRESS ? Compress : Rake)(f[ls[u]], f[rs[u]]);
		printf("%lld %lld\n", f[rt].d.x, las = f[rt].d.y);
	}
	return 0;
}