#include<bits/stdc++.h>
#define Gc() getchar()
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define eb emplace_back
#define all(x) x.begin(),x.end()
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;
const int N=4e5+5,M=N*20+5,K=1e7+5,mod=998244353,Mod=mod-1;const db eps=1e-9;const ll INF=1e13+7;mt19937 rnd(263082);
#define Tp template<typename T>
#define Ts template<typename T,typename... Ar>
namespace Debug{
	Tp void _debug(char* f,T t){cerr<<f<<'='<<t<<endl;}
	Ts void _debug(char* f,T x,Ar... y){while(*f!=',') cerr<<*f++;cerr<<'='<<x<<",";_debug(f+1,y...);}
	#ifdef LOCAL
	#define gdb(...) _debug((char*)#__VA_ARGS__,__VA_ARGS__)
	#else 
	#define gdb(...) void()
	#endif
}using namespace Debug;
int n,s,t;vector<int> S[N];
namespace ST{
	int bg[N],df[N],en[N],fa[N],d[N],st[20][N],bh;
	void clear(){
		bh=0;
		for(int i=1;i<=n;i++) S[i].clear();
	}
	void make(int x,int La){
		bg[x]=++bh;d[x]=d[La]+1;df[bh]=x;fa[x]=La;
		for(int i:S[x]) if(i^La) make(i,x);
		en[x]=bh;
	}
	bool cmp(int x,int y){return d[x]<d[y];}
	void build(){
		make(1,0);
		copy(df+1,df+n+1,st[0]+1);
		for(int i=1;(1<<i)<=n;i++){
			for(int j=1;j+(1<<i)-1<=n;j++) st[i][j]=min(st[i-1][j],st[i-1][j+(1<<i-1)],cmp);
		}
	}
	int LCA(int x,int y){
		if(bg[x]>bg[y]) swap(x,y);
		if(bg[y]<=en[x]) return x;
		x=bg[x];y=bg[y];int d=__lg(y-x+1);
		return fa[min(st[d][x],st[d][y-(1<<d)+1],cmp)];
	}
	int dist(int x,int y){
		return d[x]+d[y]-2*d[LCA(x,y)];
	}
}
int p[N],ans[N],flag,sum;
void Solve(){
	scanf("%d%d%d",&n,&s,&t);
	ST::clear();
	for(int i=1;i<n;i++){
		int x,y;scanf("%d%d",&x,&y);
		S[x].push_back(y);S[y].push_back(x);
	}
	ST::build();
	p[1]=s;p[n]=t;
	int R=1;
	for(int i=2;i<n;i++){
		while(R==s||R==t) R++;
		p[i]=R++;
	}
	sum=0;flag=0;
	for(int i=1;i<n;i++) sum^=ST::dist(p[i],p[i+1]);
	
	auto check=[](){
		if(sum<=1){
			gdb(sum,1);
			for(int i=1;i<=n;i++) printf("%d%c",p[i]," \n"[i==n]);
			return 1;
		}else if(sum<=3&&!flag){
			gdb(sum);
			flag=1;
			copy(p+1,p+n+1,ans+1);
		}
		return 0;
	};

	if(check()) return;
	if(n>3){
		for(int i=1;i<=10*n;i++){
			int x=R(n),y=R(n);
			while(x==1||x==n) x=R(n);
			while(y==1||y==n||y==x) y=R(n);
			sum^=ST::dist(p[x-1],p[x])^ST::dist(p[x],p[x+1]);
			sum^=ST::dist(p[y-1],p[y])^ST::dist(p[y],p[y+1]);
			swap(p[x],p[y]);
			sum^=ST::dist(p[x-1],p[x])^ST::dist(p[x],p[x+1]);
			sum^=ST::dist(p[y-1],p[y])^ST::dist(p[y],p[y+1]);
			if(check()) return;
		}
	}
	for(int i=1;i<=n;i++) printf("%d%c",ans[i]," \n"[i==n]);
}
int main(){
	int t=1;
	scanf("%d",&t);
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}