#include<iostream>
#include<cstdio>
#include<vector>
#include<set>
#include<algorithm>
#include<cassert>
#include<cstdlib>
#include<random>
#define N 1000000
using namespace std;
mt19937 RAND(random_device{}());
const int inf=(int)(1e9);
long long read()
{
	char c=0;
	long long sum=0;
	while (c<'0'||c>'9') c=getchar();
	while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
	return sum;
}
struct reads
{
	int num,data;
	bool operator < (const reads &t)const
	{
		return num<t.num;
	}
};
reads tong[N+1],tongs[N+1];
int T,n,op,rt,rst,leng,lengw,lengst,nws,length,lengths,lg[N+1],depth[N+1],sdepth[N+1],sfa[N+1][21],ls[N+1],rs[N+1],ans[N+1],tans[N+1],pst,dque[N+1],top,fa[N+1],sz[N+1],cnt[N+1],dp[N+1],cl[N+1],maxp[N+1];
long long k,sk,res;
bool used[N+1];
vector<int>E[N+1];
vector<int>p[N+1];
vector<int>v[N+1];
set<int>s;
void add(int x,int y)
{
	E[x].push_back(y),E[y].push_back(x);
	return;
}
int lca(int x,int y)
{
	if (sdepth[x]<sdepth[y]) swap(x,y);
	for (int i=lg[n];i>=0;--i)
		if (sdepth[sfa[x][i]]>=sdepth[y])
			x=sfa[x][i];
	if (x==y) return x;
	for (int i=lg[n];i>=0;--i)
		if (sfa[x][i]!=sfa[y][i])
			x=sfa[x][i],y=sfa[y][i];
	return sfa[x][0];
}
int dis(int x,int y)
{
	return sdepth[x]+sdepth[y]-(sdepth[lca(x,y)]<<1);
}
void dfs(int x)
{
	used[x]=sz[x]=1,maxp[x]=0;
	for (int i=0;i<E[x].size();++i)
		if (!used[E[x][i]])
			sdepth[E[x][i]]=sdepth[x]+1,sfa[E[x][i]][0]=x,dfs(E[x][i]),sz[x]+=sz[E[x][i]],maxp[x]=max(maxp[x],sz[E[x][i]]);
	maxp[x]=max(maxp[x],n-sz[x]);
	if (maxp[x]<maxp[rt]) rt=x;
	return;
}
void dfs2(int x)
{
	used[x]=1;
	for (int i=0;i<E[x].size();++i)
		if (!used[E[x][i]])
		{
			if (x==rt) cl[E[x][i]]=++lengw;
			else cl[E[x][i]]=cl[x];
			fa[E[x][i]]=x,depth[E[x][i]]=depth[x]+1,dfs2(E[x][i]);
		}
	return;
}
int smerge(int x,int y)
{
	++nws,ls[nws]=x,rs[nws]=y;
	return nws;
}
void merge(int x,int y)
{
	if (v[x].size()>v[y].size()) swap(v[x],v[y]);
	for (int i=0;i<v[x].size();++i) v[y].push_back(v[x][i]);
	v[x].clear(),v[x].shrink_to_fit();
	return;
}
void dfs3(int x)
{
	for (int i=0;i<E[x].size();++i)
		if (fa[E[x][i]]==x)
			dfs3(E[x][i]),dp[x]+=dp[E[x][i]];
	cnt[x]+=dp[x];
	return;
}
void dfs4(int x)
{
	int scnt=1,d,ds=x,pv=-1;
	for (int i=0;i<E[x].size();++i)
		if (fa[E[x][i]]==x)
			dfs4(E[x][i]),scnt+=cnt[E[x][i]];
    scnt-=cnt[x],s.clear();
	for (int i=0;i<E[x].size();++i)
		if (fa[E[x][i]]==x)
			s.insert(E[x][i]);
	for (int i=1;i<=scnt;++i)
	{
		auto it=s.begin();
		if ((*it)!=pv) d=(*it);
		else
		{
			it++;
			if (it==s.end()) it--,d=(*it);
			else d=(*it);
		}
		if (d!=pv) ds=smerge(ds,v[d].back()),v[d].pop_back();
		else ds=smerge(v[d].back(),ds),v[d].pop_back();
		if (v[d].empty()) s.erase(d);
		pv=d;
	}
	v[x].push_back(ds);
	for (int i=0;i<E[x].size();++i)
		if (fa[E[x][i]]==x)
			merge(E[x][i],x);
	return;
}
void dfs5(int x)
{
	if (x<=n) ans[++pst]=x;
	else dfs5(ls[x]),dfs5(rs[x]);
	return;
}
void adder(int x,int d)
{
	top=0;
	while (x!=rt) dque[++top]=x,x=fa[x];
	for (int i=1;i<=d;++i) cnt[dque[i]]++;
	return;
}
int get_maxn()
{
	int x=1,y=1,maxn=0;
	for (int i=1;i<=n;++i)
		if (dis(x,i)>maxn)
			y=i,maxn=dis(x,y);
	for (int i=1;i<=n;++i)
		if (dis(y,i)>maxn)
			x=i,maxn=dis(x,y);
	rst=x;
	return maxn;
}
bool dst[N+1];
bool cmp(int x,int y)
{
	return dst[x]<dst[y];
}
void dfs6(int x)
{
	used[x]=1,dst[x]=(x==rst);
	for (int i=0;i<E[x].size();++i)
		if (!used[E[x][i]])
			dfs6(E[x][i]),dst[x]|=dst[E[x][i]];
	return;
}
void dfs7(int x)
{
	ans[++leng]=x,used[x]=1,sort(E[x].begin(),E[x].end(),cmp);
	for (int i=0;i<E[x].size();++i)
		if (!used[E[x][i]])
			dfs7(E[x][i]);
	return;
}
int main()
{
	int x,y,wst,sl;
	long long sk;
	for (int i=2;i<=N;++i) lg[i]=lg[i>>1]+1;
	T=read(),maxp[0]=inf;
	for (int qt=1;qt<=T;++qt)
	{
		n=read(),sk=k=read(),op=read();
		for (int i=1;i<=n;++i) E[i].clear(),used[i]=0;
		for (int i=1;i<=n-1;++i) x=read(),y=read(),add(x,y);
		if (op==1)
		{
			rt=rst=leng=res=lengw=length=lengths=pst=0,nws=n;
			for (int i=1;i<=n;++i) sfa[i][0]=0;
			sdepth[1]=1,dfs(1);
			for (int i=1;i<=lg[n];++i)
				for (int j=1;j<=n;++j)
					sfa[j][i]=sfa[sfa[j][i-1]][i-1];
			for (int i=1;i<=n;++i) used[i]=fa[i]=cnt[i]=dp[i]=ls[i]=rs[i]=0,v[i].clear();
			depth[rt]=0,dfs2(rt);
			for (int i=1;i<=leng;++i) p[i].clear();
			for (int i=1;i<=n;++i) res+=(depth[i]<<1);
			if (k<((n-1)<<1)-get_maxn()||k>res-1)
			{
				puts("-1");
				continue;
			}
			if (k<((n-1)<<1))
			{
				k=((n-1)<<1)-k;
				for (int i=1;i<=n;++i)
					if (dis(rst,i)==k)
					{
						for (int j=1;j<=n;++j) used[j]=0;
						dfs6(i);
						for (int j=1;j<=n;++j) used[j]=0;
						dfs7(i);
						break;
					}
			}
			else
			{
				int rcnt=0,wcnt=0;
				if (n<=20) wcnt=10;
				else wcnt=2;
				sl=0;
				while (1)
				{
					for (int i=1;i<=n;++i) shuffle(E[i].begin(),E[i].end(),RAND);
					wst=RAND()%min(min((long long)(n-1),res-sk)+1,10ll),k=sk+wst,leng=length=lengths=pst=0;
					if (k&1) continue;
					rcnt++;
					if (rcnt>wcnt)
					{
						for (int i=1;i<=n;++i) ans[i]=i;
						break;
					}
					k=(k>>1)-(n-1);
					for (int i=1;i<=n;++i) used[i]=cnt[i]=dp[i]=ls[i]=rs[i]=0,v[i].clear();
					for (int i=1;i<=n;++i)
						if (i!=rt)
							cnt[i]=1;
					for (int i=1;i<=n;++i)
						if (i!=rt)
						{
							for (int j=1;j<=E[i].size()-1;++j) tong[++length]=(reads){cl[i],i};
						}
					sort(tong+1,tong+length+1);
					if (length&1) tongs[++lengths]=tong[(length+1)>>1];
					for (int i=1;i<=(length>>1);++i)
					{
						if (tong[i].num!=tongs[lengths].num) tongs[++lengths]=tong[i],tongs[++lengths]=tong[i+((length+1)>>1)];
						else tongs[++lengths]=tong[i+((length+1)>>1)],tongs[++lengths]=tong[i];
					}
					for (int i=1;i<=lengths;++i)
					{
						if (k>=depth[tongs[i].data]) dp[tongs[i].data]++,k-=depth[tongs[i].data];
						else if (k)
						{
							adder(tongs[i].data,k),k=0;
							break;
						}
					}
					dfs3(rt),length=lengths=0;
					for (int i=0;i<E[rt].size();++i)
					{
						dfs4(E[rt][i]);
						for (int j=0;j<v[E[rt][i]].size();++j) tong[++length]=(reads){i+1,v[E[rt][i]][j]};
					}
					sort(tong+1,tong+length+1);
					if (length&1) tongs[++lengths]=tong[(length+1)>>1];
					for (int i=1;i<=(length>>1);++i)
					{
						if (tong[i].num!=tongs[lengths].num) tongs[++lengths]=tong[i],tongs[++lengths]=tong[i+((length+1)>>1)];
						else tongs[++lengths]=tong[i+((length+1)>>1)],tongs[++lengths]=tong[i];
					}
					tongs[++lengths]=(reads){0,rt};
					for (int i=1;i<=lengths;++i) dfs5(tongs[i].data);
					bool opst=0;
					for (int i=1;i<=n;++i)
						if (dis(ans[i],ans[i%n+1])==wst)
						{
							opst=1,sl=i;
							break;
						}
					if (opst) break;
				}
				lengst=0;
				for (int i=sl;i>=1;--i) tans[++lengst]=ans[i];
				for (int i=n;i>=sl+1;--i) tans[++lengst]=ans[i];
				reverse(tans+1,tans+lengst+1);
				for (int i=1;i<=n;++i) ans[i]=tans[i];
			}
			for (int i=1;i<=n;++i) printf("%d ",ans[i]);
			puts("");
		}
		else
		{
			rt=leng=res=length=lengths=lengw=pst=0,nws=n;
			for (int i=1;i<=n;++i) sfa[i][0]=0;
			sdepth[1]=1,dfs(1);
			for (int i=1;i<=lg[n];++i)
				for (int j=1;j<=n;++j)
					sfa[j][i]=sfa[sfa[j][i-1]][i-1];
			for (int i=1;i<=n;++i) used[i]=fa[i]=cnt[i]=dp[i]=ls[i]=rs[i]=0,v[i].clear();
			depth[rt]=0,dfs2(rt);
			for (int i=1;i<=leng;++i) p[i].clear();
			for (int i=1;i<=n;++i) res+=(depth[i]<<1);
			if (k<((n-1)<<1)||k>res||(k&1))
			{
				puts("-1");
				continue;
			}
			k=(k>>1)-(n-1);
			for (int i=1;i<=n;++i)
				if (i!=rt)
					cnt[i]=1;
			for (int i=1;i<=n;++i)
				if (i!=rt)
				{
					for (int j=1;j<=E[i].size()-1;++j) tong[++length]=(reads){cl[i],i};
				}
			sort(tong+1,tong+length+1);
			if (length&1) tongs[++lengths]=tong[(length+1)>>1];
			for (int i=1;i<=(length>>1);++i)
			{
				if (tong[i].num!=tongs[lengths].num) tongs[++lengths]=tong[i],tongs[++lengths]=tong[i+((length+1)>>1)];
				else tongs[++lengths]=tong[i+((length+1)>>1)],tongs[++lengths]=tong[i];
			}
			for (int i=1;i<=lengths;++i)
			{
				if (k>=depth[tongs[i].data]) dp[tongs[i].data]++,k-=depth[tongs[i].data];
				else if (k)
				{
					adder(tongs[i].data,k),k=0;
					break;
				}
			}
			dfs3(rt),length=lengths=0;
			for (int i=0;i<E[rt].size();++i)
			{
				dfs4(E[rt][i]);
				for (int j=0;j<v[E[rt][i]].size();++j) tong[++length]=(reads){i+1,v[E[rt][i]][j]};
			}
			sort(tong+1,tong+length+1);
			if (length&1) tongs[++lengths]=tong[(length+1)>>1];
			for (int i=1;i<=(length>>1);++i)
			{
				if (tong[i].num!=tongs[lengths].num) tongs[++lengths]=tong[i],tongs[++lengths]=tong[i+((length+1)>>1)];
				else tongs[++lengths]=tong[i+((length+1)>>1)],tongs[++lengths]=tong[i];
			}
			tongs[++lengths]=(reads){0,rt};
			for (int i=1;i<=lengths;++i) dfs5(tongs[i].data);
			for (int i=1;i<=n;++i) printf("%d ",ans[i]);
			puts("");
		}
	}
	return 0;
}