//#pragma GCC optimize(3,"Ofast","inline")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 2e5 + 10, inf = 0x3f3f3f3f;
int n, minn, s, t, now, dep[N], dfn[N], dis[210][210], idx, id[N];
int p[N], p2[N], st[21][N], fa[N];
bool vis[N];
vector<int> vec[N];
inline ll read(){
	ll x = 0, m = 1;
	char ch = getchar();
	while(!isdigit(ch)){
		if(ch == '-') m = -1;
		ch = getchar();
	}
	while(isdigit(ch)){
		x = (x << 1) + (x << 3) + (ch ^ 48);
		ch = getchar();
	}
	return x * m;
}
inline void write(ll x){
	if(x < 0){
		putchar('-');
		write(-x);
		return;
	}
	if(x >= 10) write(x / 10);
	putchar(x % 10 + '0');
}
inline int dep_min(int x, int y){
	return dep[x] > dep[y] ? y : x;
}
inline int lca(int u, int v){
	if(u == v) return u;
	u = dfn[u], v = dfn[v];
	if(u > v) swap(u, v);
	++ u;
	int x = __lg(v - u + 1);
	return dep_min(st[x][u], st[x][v - (1 << x) + 1]);
}
inline int get_dis(int u, int v){
	if(!u || !v) return -1;
	return dep[u] + dep[v] - (dep[lca(u, v)] << 1);
}
inline void check(){
	int res = 0;
	for(int i = 1; i < n; ++ i) res ^= dis[p[i]][p[i + 1]];
	if(res < minn){
		minn = res;
		for(int i = 1; i <= n; ++ i) p2[i] = p[i];
	}
}
inline void dfs(int u){
	dfn[u] = ++ idx, id[idx] = u;
	for(int v : vec[u]){
		if(v == fa[u]) continue;
		fa[v] = u, dep[v] = dep[u] + 1;
		dfs(v);
	}
}
inline void dfs2(int dep){
	if(dep == n){
		check();
		return;
	}
	for(int i = 1; i <= n; ++ i){
		if(vis[i]) continue;
		if(dis[i][p[dep - 1]] > 4) continue;
		p[dep] = i, vis[i] = 1;
		dfs2(dep + 1), vis[i] = 0;
	}
}
inline void get_in(){
	n = read(), s = read(), t = read(), idx = now = 0;
	for(int i = 1; i <= n; ++ i) vec[i].clear(), dep[i] = fa[i] = 0;
	for(int i = 2; i <= n; ++ i){
		int u = read(), v = read();
		vec[u].push_back(v), vec[v].push_back(u);
	}
	p[1] = s, p[n] = t;
}
inline void init(){
	dfs(1);
	for(int i = 2; i <= n; ++ i) st[0][i] = fa[id[i]];
	for(int j = 1; j <= 19; ++ j){
		for(int i = 1; i + (1 << j) - 1 <= n; ++ i){
			st[j][i] = dep_min(st[j - 1][i], st[j - 1][i + (1 << (j - 1))]);
		}
	}
}
inline bool Chrysanthemum(){
	for(int i = 1; i <= n; ++ i) if(vec[i].size() == n - 1) return 1;
	return 0;
}
inline void work(){
	minn = inf;
	for(int i = 1; i <= n; ++ i){
		for(int j = 1; j <= n; ++ j){
			dis[i][j] = get_dis(i, j);
		}
		vis[i] = 0;
	}
	vis[s] = vis[t] = 1;
	dfs2(2);
	for(int i = 1; i <= n; ++ i) write(p2[i]), putchar(' ');
	putchar('\n');
}
inline int get_rand(int l, int r){
	ll x = (1ll * rand() * rand() * rand()) % 1000000000;
	return x % (r - l + 1) + l; 
}
inline int calc(int x){
	return get_dis(p[x - 1], p[x]) ^ get_dis(p[x], p[x + 1]);
}
inline void solve(){
	srand(time(0));
	get_in(), init();	
	for(int i = 1; i <= n; ++ i) if(i != s && i != t) p[i - (i > s) - (i > t) + 1] = i;
	for(int i = 1; i < n; ++ i) now ^= get_dis(p[i], p[i + 1]);
	if(Chrysanthemum()){for(int i = 1; i <= n; ++ i) write(p[i]), putchar(' '); putchar('\n'); return;}
	if(n <= 9){work(); return;}
	while(now > 1){
		int x = get_rand(2, n - 1), y = get_rand(2, n - 1);
		while(x == y) y = get_rand(2, n - 1);
		now ^= (calc(x) ^ calc(y));
		swap(p[x], p[y]);
		now ^= (calc(x) ^ calc(y));
	}
	for(int i = 1; i <= n; ++ i) write(p[i]), putchar(' ');
	putchar('\n');
}
signed main(){
	//freopen(".in", "r", stdin);
	//freopen(".out", "w", stdout);
	int T = read();
	while(T --) solve();
	return 0;
}