/*
I know this sky loves you
いずれ全て
変わってしまったって
空は青いだろうよ
*/

# include <bits/stdc++.h>

const int N=50010,INF=0x3f3f3f3f;

inline int read(void){
	int res,f=1;
	char c;
	while((c=getchar())<'0'||c>'9')
		if(c=='-') f=-1;
	res=c-48;
	while((c=getchar())>='0'&&c<='9')
		res=res*10+c-48;
	return res*f;
}
int p[N];
int n,s,t;
std::vector <int> G[N];
int dfn[N],dep[N],tc,mx[N][21],fa[N];

void dfs(int x,int fa){
	dfn[x]=++tc,dep[x]=dep[fa]+1,mx[tc][0]=x,::fa[x]=fa;
	for(auto y:G[x]){
		if(y==fa) continue;
		dfs(y,x);
	}
	return;
}
inline int cmp(int x,int y){
	return dep[x]<dep[y]?x:y;
}
inline void init(void){
	for(int k=1;k<=17;++k)
		for(int i=1;i+(1<<k)-1<=n;++i) mx[i][k]=cmp(mx[i][k-1],mx[i+(1<<(k-1))][k-1]);
	return;
}

inline int lca(int u,int v){
	if(u==v) return u;
	u=dfn[u],v=dfn[v]; if(u>v) std::swap(u,v); ++u;
	int k=std::__lg(v-u+1);
	return fa[cmp(mx[u][k],mx[v-(1<<k)+1][k])];
}
inline int dis(int u,int v){
	return dep[u]+dep[v]-2*dep[lca(u,v)];
}

inline void print(void){
	for(int i=1;i<=n;++i) printf("%d ",p[i]); puts("");
	return;
}

std::mt19937 rng(114514);

inline bool flower(void){
	int dec=0; for(int i=1;i<=n;++i) if(G[i].size()>1) ++dec;
	return dec<=1;
}

int g[N];

inline void calc(void){
//	if(flower()) return print();

	if(n<=10){
		int ans=INF;
		memcpy(g,p,(n+5)*4);
		do{
			int cur=0;
			for(int i=2;i<=n;++i) cur^=dis(p[i-1],p[i]);
			if(ans>cur) ans=cur;
			if(ans<=1) break;
		}while(std::next_permutation(p+2,p+n));
		memcpy(p,g,(n+5)*4);

		do{
			int cur=0;
			for(int i=2;i<=n;++i) cur^=dis(p[i-1],p[i]);
			if(ans==cur) return print();
		}while(std::next_permutation(p+2,p+n));
	}else{
		int T=std::min(30*n,400000);
		int ans=0;
		for(int i=2;i<=n;++i) ans^=dis(p[i-1],p[i]);
		while(T--){
			int x=rng()%(n-2)+2,y=rng()%(n-2)+2;
			if(x==y) continue;
			ans^=dis(p[x-1],p[x])^dis(p[x],p[x+1])^dis(p[y-1],p[y])^dis(p[y],p[y+1]);
			std::swap(p[x],p[y]);
			ans^=dis(p[x-1],p[x])^dis(p[x],p[x+1])^dis(p[y-1],p[y])^dis(p[y],p[y+1]);
			if(ans<=1) return print();
		}
		return print();
	}

	return;
}

inline void solve(void){
	n=read(),s=read(),t=read(),tc=0;
	p[1]=s,p[n]=t;
	for(int i=2,j=1;i<n;++i){ while(j==s||j==t) ++j; p[i]=j++;}
	for(int i=1;i<=n;++i) G[i].clear();
	for(int i=1;i<n;++i){
		int u=read(),v=read(); G[u].push_back(v),G[v].push_back(u);
	}
	dfs(1,0),init();
	calc();

	return;
}

int main(void){
//	freopen("in.txt","r",stdin);
//	freopen("a.txt","w",stdout);

	int T=read();
	while(T--) solve();
	

	return 0;
}