#include<bits/stdc++.h>
using namespace std;
namespace gza{
	#define pb push_back
	#define MT int TTT=R;while(TTT--)
	#define pc putchar
	#define R read()
	#define fo(i,a,b) for(signed i=a;i<=b;i++)
	#define rep(i,a,b) for(signed i=a;i>=b;i--)
	#define m1(a,b) memset(a,b,sizeof a)
	namespace IO
	{
		inline int read()
		{
		    int x=0;
		    char ch=getchar();
		    bool f=0;
		    while(!isdigit(ch)){if(ch=='-') f=1;ch=getchar();}
		    while(isdigit(ch)) x=(x<<1)+(x<<3)+(ch^48),ch=getchar();
		    if(f) x=-x;
		    return x;
		}
		template<typename T> inline void write(T x)
		{
		    if(x<0) pc('-'),x=-x;
		    if(x>9) write(x/10);
		    pc(x%10+'0');
		}
	};
	using namespace IO;

	const int N=5e4+10,M=16;
	int n,s,t,ans;
	vector<int> g[N];
	int f[N][M];
	int deg[N],dep[N];
	int p[N],ansp[N];
	void dfs(int u,int fa)
	{
		f[u][0]=fa;
		for(auto j:g[u]) if(j!=fa) dep[j]=dep[u]+1,dfs(j,u);
	}
	int lca(int a,int b)
	{
		if(dep[a]<dep[b]) swap(a,b);
		rep(i,15,0) if(dep[f[a][i]]>=dep[b]) a=f[a][i];
		if(a==b) return a;
		rep(i,15,0) if(f[a][i]!=f[b][i]) a=f[a][i],b=f[b][i];
		return f[a][0];
	}
	int dis(int a,int b)
	{
		return dep[a]+dep[b]-dep[lca(a,b)];
	}
	int calc()
	{
		int res=0;
		fo(i,1,n-1) res^=dis(p[i],p[i+1]);
		return res;
	}
	int get(int x)
	{
		return dis(p[x],p[x-1])^dis(p[x],p[x+1]);
	}
	void solve(){
		n=R,s=R,t=R;
		fo(i,1,n) g[i].clear(),deg[i]=dep[i]=p[i]=ansp[i]=0;
		fo(i,1,n) fo(j,0,15) f[i][j]=0;
		fo(i,2,n)
		{
			int u=R,v=R;
			g[u].pb(v),g[v].pb(u);
			deg[u]++,deg[v]++;
		}
		dfs(1,0);
		fo(j,1,15) fo(i,1,n) f[i][j]=f[f[i][j-1]][j-1];
		int maxd=(*max_element(deg+1,deg+n+1));
		p[1]=s,p[n]=t;
		fo(i,1,n) if(i!=s&&i!=t) p[i-(i>s)-(i>t)+1]=i;
		if(maxd==n-1)
		{
			fo(i,1,n) write(p[i]),pc(' ');
			puts("");
		}
		else if(n<=9)
		{
			int res=calc();
			fo(i,1,n) ansp[i]=p[i];
			do
			{
				ans=calc();
				if(ans<res)
				{
					fo(i,1,n) ansp[i]=p[i];
					res=ans;
				}
			}while(next_permutation(p+2,p+n));
			fo(i,1,n) write(ansp[i]),pc(' ');
			puts("");
		}
		else
		{
			ans=calc();
			while(ans>1)
			{
				int x=rand()%(n-2)+2,y=rand()%(n-2)+2;
				while(x==y) y=rand()%(n-2)+2;
				ans^=get(x)^get(y);
				swap(p[x],p[y]);
				ans^=get(x)^get(y);
			}
			fo(i,1,n) write(p[i]),pc(' ');
			puts("");
		}
	}
	void main(){
		srand(time(0));
		MT solve();
	}
}
signed main(){
	
	gza::main();
}