#include <bits/stdc++.h>
#define eb emplace_back
#define mt make_tuple
#define mp make_pair
#define fi first
#define se second

using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pi;
typedef vector<int> vi;
bool Mbe;

const int N = 5e5 + 5;
const int inf = 1e9;

int n, top, fa[N], sz[N], son[N];
vector<int> G[N];

struct T {
	int d; ll c;
	T () : d(inf), c(0) { }
	T (int _d, ll _c) : d(_d), c(_c) { }
	T operator + (const T &rh) const {
		if (d < rh.d) return *this;
		if (d > rh.d) return rh;
		return T(d, c + rh.c);
	}
};

struct P {
	int x, y, d, op;
	T l, r, m;
	P () { }
	P (int _x, int _y, int _d, int _op, T _l, T _r, T _m) :
		x(_x), y(_y), d(_d), op(_op), l(_l), r(_r), m(_m) { }
};

int rt, tot;
struct S { 
	int lc, rc, fa, sz; P vl; 
	S () { }
	S (int _lc, int _rc, int _fa, int _sz, P _vl) :
		lc(_lc), rc(_rc), fa(_fa), sz(_sz), vl(_vl) { }
} t[N << 2];
#define ls(x) t[x].lc
#define rs(x) t[x].rc

P cp(const P &L, const P &R) {
	return P(L.x, R.y, L.d + R.d, 0, 
	L.l + T(L.d + R.l.d, R.l.c), 
	R.r + T(R.d + L.r.d, L.r.c),
	L.m + R.m + T(L.r.d + R.l.d, L.r.c * R.l.c));
}

P rk(const P &L, const P &R) {
	return P(L.x, L.y, L.d, 1, 
	L.l + R.l, L.r + T(L.d + R.l.d, R.l.c),
	L.m + R.m + T(L.l.d + R.l.d, L.l.c * R.l.c));
}

int bld(vi::iterator l, vi::iterator r, auto op) {
	if (l == r - 1) return *l;
	int sum = 0, cur = 0; auto mid = l;
	for (auto i = l; i != r; i++) sum += t[*i].sz;
	for (auto i = l; i != r; i++) {
		cur += t[*i].sz;
		if (cur * 2 <= sum) mid = i + 1;
	}
	int L = bld(l, mid, op), R = bld(mid, r, op);
	t[++tot] = S(L, R, 0, t[L].sz + t[R].sz, op(t[L].vl, t[R].vl)), t[L].fa = t[R].fa = tot;
	return tot;
}

void dfs1(int u, int f) {
	sz[u] = 1, fa[u] = f;
	t[u] = S(0, 0, 0, 1, P(f, u, 1, -1, T(1, 1), T(0, 1), T()));
	for (int v : G[u]) {
		if (v == f) continue;
		dfs1(v, u), sz[u] += sz[v];
		if (sz[v] > sz[son[u]]) son[u] = v;
	}
}

int dfs2(int u) {
	vi p = { u };
	while (son[u]) {
		vi q = { son[u] };
		for (int v : G[u]) 
			if (v != fa[u] && v != son[u]) q.eb(dfs2(v));
		p.eb(bld(q.begin(), q.end(), rk)), u = son[u];
	}
	return bld(p.begin(), p.end(), cp);
}

void solve() {
	cin >> n >> top, tot = n;
	for (int i = 1, u, v; i < n; i++)
		cin >> u >> v, G[u].eb(v), G[v].eb(u);
	dfs1(1, 0), rt = dfs2(1);
	ll lst = 0, u;
	for (int i = 1; i <= n - 2; i++) {
		cin >> u; 
		if (top) u ^= lst;
		t[u].vl.l = t[u].vl.r = t[u].vl.m = T();
		while (u = t[u].fa) {
			if (!t[u].vl.op) t[u].vl = cp(t[ls(u)].vl, t[rs(u)].vl);
			else t[u].vl = rk(t[ls(u)].vl, t[rs(u)].vl);
		}
		cout << t[rt].vl.m.d << ' ' << (lst = t[rt].vl.m.c) << '\n';
	}
}

// #define FILE

bool Med;
int main() {
	ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
	cerr << (&Mbe - &Med) / 1048576.0 << " MB\n";
	#ifdef FILE
		freopen(".in", "r", stdin);
		freopen(".out", "w", stdout);
	#endif
	int T = 1;
	// cin >> T;
	while (T--) solve();
	cerr << (int)(1e3 * clock() / CLOCKS_PER_SEC) << " ms\n";
	return 0;
}