#include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i <= b; i++)
#define per(i, b, a) for (int i = b; i >= a; i--)
using namespace std;

const int N = 1e5 + 5;

vector <int> adj[N];
int st[N][17], lg[N], dep[N], id[N], p[N], used[N], res[N];
int T, n, s, t, len;

void dfs1(int u, int fa) {
	st[++len][0] = u; id[u] = len;
	for (auto v : adj[u]) {
		if (v == fa) continue;
		dep[v] = dep[u] + 1;
		dfs1(v, u);
		st[++len][0] = u;
	}
}

int cmp(int i, int j) {
	return dep[i] < dep[j] ? i : j;
}

int lca(int l, int r) {
	l = id[l]; r = id[r];
	if (l > r) swap(l, r);
	int k = lg[r - l + 1];
	return cmp(st[l][k], st[r - (1 << k) + 1][k]);
}

int dis(int u, int v) {
	return dep[u] + dep[v] - dep[lca(u, v)] * 2;
}

mt19937 rng(time(0));

int calc() {
	int ans = 0;
	for (int i = 1; i < n; i++) ans ^= dis(p[i], p[i + 1]);
	return ans;
}

vector <int> vec[30];
int ID[N];

int main() {
	scanf("%d", &T);
	while (T--) {
		len = 0;
		scanf("%d%d%d", &n, &s, &t);
		for (int i = 1; i <= n; i++) adj[i].clear();
		for (int i = 1; i < n; i++) {
			int u, v;
			scanf("%d%d", &u, &v);
			adj[u].push_back(v);
			adj[v].push_back(u);
		}
		dfs1(1, 0);
		for (int j = 1; j <= 16; j++) {
			for (int i = 1; i <= len - (1 << j) + 1; i++) {
				st[i][j] = cmp(st[i][j - 1], st[i + (1 << (j - 1))][j - 1]);
			}
		}
		lg[0] = -1;
		for (int i = 1; i <= len; i++) lg[i] = lg[i >> 1] + 1;
		if (n <= 6) {
			for (int i = 1; i <= n; i++) p[i] = i;
			int minn = 1e9;
			do {
				if (p[1] == s && p[n] == t) {
					int now = calc();
					if (now < minn) {
						minn = now;
						for (int i = 1; i <= n; i++) res[i] = p[i];
					}
				}
			} while (next_permutation(p + 1, p + n + 1));
			for (int i = 1; i <= n; i++) printf("%d%c", res[i], i == n ? '\n' : ' ');
			continue;
		}
		for (int i = 1; i <= n; i++) used[i] = 0;
		used[s] = used[t] = 1;
		p[1] = s; p[n] = t;
		for (int i = 2, j = 1; i <= n - 1; i++) {
			while (used[j]) ++j;
			used[j] = 1; p[i] = j;
		}
		int cnt = 100;
		if (n >= 50) cnt = 30;
		int minn = 1e9;
		for (int _ = 1; _ <= cnt; _++) {
			memset(ID, 0, n * 4);
			shuffle(p + 2, p + n, rng);
			int now = calc();
			for (int i = 2; i <= n - 2; i += 3) {
				int diff = dis(p[i - 1], p[i]) ^ dis(p[i + 1], p[i + 2]) ^ dis(p[i - 1], p[i + 1]) ^ dis(p[i], p[i + 2]);
				ID[diff] = i;
			}
			for (int i = n - 1; i >= 1; i--) {
				if (ID[i] && (now ^ i) < now) {
					now ^= i;
					swap(p[ID[i]], p[ID[i] + 1]);
				}
			}
			if (now < minn) {
				minn = now;
				memcpy(res, p, (n + 1) * 4);
			}
		}
		for (int i = 1; i <= n; i++) printf("%d%c", res[i], i == n ? '\n' : ' ');
	}
	return 0;
}