// Author: Klay Thompson
// Problem: P6845 [CEOI2019] Dynamic Diameter
// Memory Limit: 1 MB
// Time Limit: 3000 ms
// 
// Powered by CP Editor (https://cpeditor.org)

#include <bits/stdc++.h>
#ifdef dbg
#define D(...) fprintf(stderr, __VA_ARGS__)
#define DD(...) D("[Debug] "#__VA_ARGS__ " = "), \
              debug_helper::debug(__VA_ARGS__), D("\n")
#include "C:\Users\wsyear\Desktop\OI\templates\debug.hpp"
#else
#define D(...) ((void)0)
#define DD(...) ((void)0)
#endif
#define rep(i, j, k) for (int i = (j); i <= (k); ++i)
#define per(i, j, k) for (int i = (j); i >= (k); --i)
#define SZ(v) int((v).size())
#define ALL(v) (v).begin(),(v).end()
#define fi first
#define se second
using ll = long long;
using pii = std::pair<int, int>;
using pll = std::pair<ll, ll>;

template<class T> void chkmn(T &x, T y) { if (y < x) x = y; }
template<class T> void chkmx(T &x, T y) { if (y > x) x = y; }

using namespace std;

namespace FastIO
{
// ------------------------------
// #define IN_HAS_NEG
// #define OUT_HAS_NEG
// #define CHK_EOF
// #define DISABLE_MMAP
// ------------------------------
#if __cplusplus < 201400
#error Please use C++14 or higher.
#endif
#if __cplusplus > 201700
#define INLINE_V inline
#else
#define INLINE_V
#endif
#if ( defined(LOCAL) || defined(_WIN32) ) && !defined(DISABLE_MMAP)
#define DISABLE_MMAP
#endif
#ifndef DISABLE_MMAP
#include<sys/mman.h>
#endif
#ifdef LOCAL
	inline char gc() { return getchar(); }
	inline void pc(char c) { putchar(c); }
#else
#ifdef DISABLE_MMAP
	INLINE_V constexpr int _READ_SIZE = 1 << 18;
	INLINE_V static char _read_buffer[_READ_SIZE], *_read_ptr = nullptr, *_read_ptr_end = nullptr;
	inline char gc()
	{
		if ( __builtin_expect(_read_ptr == _read_ptr_end, false) )
		{
			_read_ptr = _read_buffer;
			_read_ptr_end = _read_buffer + fread(_read_buffer, 1, _READ_SIZE, stdin);
#ifdef CHK_EOF
			if ( __builtin_expect(_read_ptr == _read_ptr_end, false) ) return EOF;
#endif
		}
		return *_read_ptr++;
	}
#else
	INLINE_V static const char *_read_ptr = (const char *)mmap(nullptr, INT_MAX, 1, 2, 0, 0);
	inline char gc() { return *_read_ptr++; }
#endif
	INLINE_V constexpr int _WRITE_SIZE = 1 << 18;
	INLINE_V static char _write_buffer[_WRITE_SIZE], *_write_ptr = _write_buffer;
	inline void pc(char c)
	{
		*_write_ptr++ = c;
		if ( __builtin_expect(_write_buffer + _WRITE_SIZE == _write_ptr, false) )
		{
			fwrite(_write_buffer, 1, _write_ptr - _write_buffer, stdout);
			_write_ptr = _write_buffer;
		}
	}
	INLINE_V struct _auto_flush
	{
		inline ~_auto_flush() { fwrite(_write_buffer, 1, _write_ptr - _write_buffer, stdout); }
	}	_auto_flush;
#endif
#ifdef CHK_EOF
	inline constexpr bool _isdigit(char c) { return ( c & 16 ) && c != EOF; }
	inline constexpr bool _isgraph(char c) { return c > 32 && c != EOF; }
#else
	inline constexpr bool _isdigit(char c) { return c & 16; }
	inline constexpr bool _isgraph(char c) { return c > 32; }
#endif
	template < class T >
	INLINE_V constexpr bool _is_integer = numeric_limits < T >::is_integer;
	template < class T >
	INLINE_V constexpr bool _is_signed = numeric_limits < T >::is_signed;
	template < class T >
	INLINE_V constexpr bool _is_unsigned = _is_integer < T > && !_is_signed < T >;
	template <> INLINE_V constexpr bool _is_integer < __int128 > = true;
	template <> INLINE_V constexpr bool _is_integer < __uint128_t > = true;
	template <> INLINE_V constexpr bool _is_signed < __int128 > = true;
	template <> INLINE_V constexpr bool _is_unsigned < __uint128_t > = true;
#undef INLINE_V
	inline void read(char &c) { do c = gc(); while ( !_isgraph(c) ); }
	inline void read_cstr(char *s)
	{
		char c = gc(); while ( !_isgraph(c) ) c = gc();
		while ( _isgraph(c) ) *s++ = c, c = gc();
		*s = 0;
	}
	inline void read(string &s)
	{
		char c = gc(); s.clear(); while ( !_isgraph(c) ) c = gc();
		while ( _isgraph(c) ) s.push_back(c), c = gc();
	}
#ifdef IN_HAS_NEG
	template < class T, enable_if_t < _is_signed < T >, int > = 0 >
	inline void read(T &x)
	{
		char c = gc(); bool f = true; x = 0;
		while ( !_isdigit(c) ) { if ( c == 45 ) f = false; c = gc(); }
		if ( f ) while ( _isdigit(c) ) x = x * 10 + ( c & 15 ), c = gc();
		else     while ( _isdigit(c) ) x = x * 10 - ( c & 15 ), c = gc();
	}
	template < class T, enable_if_t < _is_unsigned < T >, int > = 0 >
#else
	template < class T, enable_if_t < _is_integer < T >, int > = 0 >
#endif
	inline void read(T &x)
	{
		char c = gc(); while ( !_isdigit(c) ) c = gc();
		x = 0; while ( _isdigit(c) ) x = x * 10 + ( c & 15 ), c = gc();
	}
	inline void write(char c) { pc(c); }
	inline void write_cstr(const char *s) { while ( *s ) pc(*s++); }
	inline void write(const string &s) { for ( char c : s ) pc(c); }
#ifdef OUT_HAS_NEG
	template < class T, enable_if_t < _is_signed < T >, int > = 0 >
	inline void write(T x)
	{
		char buffer[numeric_limits < T >::digits10 + 1]; int digits = 0;
		if ( x >= 0 )  do buffer[digits++] =  ( x % 10 ) | 48, x /= 10; while ( x );
		else { pc(45); do buffer[digits++] = -( x % 10 ) | 48, x /= 10; while ( x ); }
		while ( digits ) pc(buffer[--digits]);
	}
	template < class T, enable_if_t < _is_unsigned < T >, int > = 0 >
#else
	template < class T, enable_if_t < _is_integer < T >, int > = 0 >
#endif
	inline void write(T x)
	{
		char buffer[numeric_limits < T >::digits10 + 1]; int digits = 0;
		do buffer[digits++] = ( x % 10 ) | 48, x /= 10; while ( x );
		while ( digits ) pc(buffer[--digits]);
	}
	template < int N > struct _tuple_io_helper
	{
		template < class ...T >
		static inline void _read(tuple < T... > &x)
		{ _tuple_io_helper < N - 1 >::_read(x), read(get < N - 1 > (x)); }
		template < class ...T >
		static inline void _write(const tuple < T... > &x)
		{ _tuple_io_helper < N - 1 >::_write(x), pc(32), write(get < N - 1 > (x)); }
	};
	template <> struct _tuple_io_helper < 1 >
	{
		template < class ...T >
		static inline void _read(tuple < T... > &x) { read(get < 0 > (x)); }
		template < class ...T >
		static inline void _write(const tuple < T... > &x) { write(get < 0 > (x)); }
	};
	template < class ...T >
	inline void read(tuple < T... > &x) { _tuple_io_helper < sizeof...(T) >::_read(x); }
	template < class ...T >
	inline void write(const tuple < T... > &x) { _tuple_io_helper < sizeof...(T) >::_write(x); }
	template < class T1, class T2 >
	inline void read(pair < T1, T2 > &x) { read(x.first), read(x.second); }
	template < class T1, class T2 >
	inline void write(const pair < T1, T2 > &x) { write(x.first), pc(32), write(x.second); }
	template < class T1, class ...T2 >
	inline void read(T1 &x, T2 &...y) { read(x), read(y...); }
	template < class ...T >
	inline void read_cstr(char *x, T *...y) { read_cstr(x), read_cstr(y...); }
	template < class T1, class ...T2 >
	inline void write(const T1 &x, const T2 &...y) { write(x), write(y...); }
	template < class ...T >
	inline void write_cstr(const char *x, const T *...y) { write_cstr(x), write_cstr(y...); }
	template < class T >
	inline void print(const T &x) { write(x); }
	inline void print_cstr(const char *x) { write_cstr(x); }
	template < class T1, class ...T2 >
	inline void print(const T1 &x, const T2 &...y) { print(x), pc(32), print(y...); }
	template < class ...T >
	inline void print_cstr(const char *x, const T *...y) { print_cstr(x), pc(32), print_cstr(y...); }
	inline void println() { pc(10); }
	inline void println_cstr() { pc(10); }
	template < class ...T >
	inline void println(const T &...x) { print(x...), pc(10); }
	template < class ...T >
	inline void println_cstr(const T *...x) { print_cstr(x...), pc(10); }
}
using namespace FastIO;

const int maxn = 1000010;

struct node {
  int l, r, mn, len;
  ll sl, sr, smn;
  node() { l = r = mn = len = sl = sr = smn = 0; }
} t[maxn];

int n, tp, m, a[maxn], dep[maxn], pa[maxn], sz[maxn], son[maxn];
int top[maxn], dn[maxn], stk[maxn], ls[maxn], rs[maxn], ty[maxn], fa[maxn], s[maxn], stop, tot, rt;
vector<int> e[maxn];

void dfs(int u) {
  sz[u] = 1, dep[u] = dep[pa[u]] + 1;
  for (int v : e[u]) {
    if (v == pa[u]) continue;
    pa[v] = u, dfs(v), sz[u] += sz[v];
    if (sz[v] > sz[son[u]]) son[u] = v;
  }
}

void update(int u) {
  t[u].len = 1;
  if (a[u]) {
    t[u].l = 1, t[u].sl = 1;
    t[u].r = 0, t[u].sr = 1;
    t[u].mn = 1e9, t[u].smn = 0;
  } else {
    t[u].l = t[u].r = t[u].mn = 1e9;
    t[u].sl = t[u].sr = t[u].smn = 0;
  }
}

node rake(node x, node y) {
  node res;
  res.len = x.len;
  res.l = min(x.l, y.l);
  if (res.l == x.l) res.sl += x.sl;
  if (res.l == y.l) res.sl += y.sl;
  res.r = min(x.r, x.len + y.l);
  if (res.r == x.r) res.sr += x.sr;
  if (res.r == x.len + y.l) res.sr += y.sl;
  res.mn = min({x.mn, y.mn, x.l + y.l});
  if (res.mn == x.mn) res.smn += x.smn;
  if (res.mn == y.mn) res.smn += y.smn;
  if (res.mn == x.l + y.l) res.smn += x.sl * y.sl;
  return res;
}

node compress(node x, node y) {
  node res;
  res.len = x.len + y.len;
  res.l = min(x.l, x.len + y.l);
  if (res.l == x.l) res.sl += x.sl;
  if (res.l == x.len + y.l) res.sl += y.sl;
  res.r = min(y.r, y.len + x.r);
  if (res.r == y.r) res.sr += y.sr;
  if (res.r == y.len + x.r) res.sr += x.sr;
  res.mn = min({x.mn, y.mn, x.r + y.l});
  if (res.mn == x.mn) res.smn += x.smn;
  if (res.mn == y.mn) res.smn += y.smn;
  if (res.mn == x.r + y.l) res.smn += x.sr * y.sl;
  return res;
}

void pushup(int u) {
  if (!ls[u] && !rs[u]) return;
  if (ty[u] == 0) t[u] = rake(t[ls[u]], t[rs[u]]);
  else t[u] = compress(t[ls[u]], t[rs[u]]);
}

int build(int l, int r, int o) {
  if (l > r) return 0;
  if (l == r) return stk[l];
  int mid = l, cur = s[stk[l]], sum = 0, rt = ++tot;
  rep (i, l, r) sum += s[stk[i]];
  while (mid < r - 1 && cur < sum - cur) mid++, cur += s[stk[mid]];
  ls[rt] = build(l, mid, o), rs[rt] = build(mid + 1, r, o), ty[rt] = o;
  if (ty[rt]) dn[rt] = dn[rs[rt]];
  else dn[rt] = dn[ls[rt]];
  fa[ls[rt]] = rt, fa[rs[rt]] = rt, top[rt] = top[ls[rt]], s[rt] = s[ls[rt]] + s[rs[rt]];
  return pushup(rt), rt;
}

void dfs2(int u) {
  int lim = stop + 1;
  if (u != 1) stk[++stop] = u;
  for (int x = u; son[x]; x = son[x]) {
    stk[++stop] = son[x];
    int cur = stop;
    for (int y : e[x]) if (y != pa[x] && y != son[x]) dfs2(y);
    int tmp = build(cur, stop, 0);
    stop = cur, stk[stop] = tmp;
  }
  int tmp = build(lim, stop, 1);
  stop = lim, stk[stop] = tmp;
}

int main() {
  cin.tie(nullptr) -> ios::sync_with_stdio(false);
  read(n, tp);
  rep (i, 1, n - 1) {
    int u, v;
    read(u, v);
    e[u].emplace_back(v);
    e[v].emplace_back(u);
  }
  rep (i, 1, n) a[i] = 1;
  dfs(1);
  rep (i, 2, n) {
    dn[i] = i, top[i] = pa[i], s[i] = 1;
    update(i);
  }
  tot = n, dfs2(1), rt = stk[1];
  ll lst = 0, flg = 1;
  rep (_, 1, n - 2) {
    ll u;
    read(u), u ^= (lst * tp);
    a[u] = 0;
    if (u == 1) {
      flg = 0;
    } else {
      update(u);
      while (u) pushup(u), u = fa[u];
    }
    int mn = t[rt].mn;
    ll ans = t[rt].smn;
    if (flg) {
      if (t[rt].l < mn) mn = t[rt].l, ans = t[rt].sl;
      else if (t[rt].l == mn) ans += t[rt].sl;
    }
    println(mn, lst = ans);
  }
}