#include<bits/stdc++.h>
#define int long long
const int N = 5e5+5;
int ans[N];
using namespace std;
int sum(int l,int r){  //等差数列求和 
	return (l + r) * (r - l + 1) / 2;
}
signed main(){
	int t;scanf("%lld",&t);
	while(t--){
		int n,a,b;scanf("%lld%lld%lld",&n,&a,&b);
		if(a < sum(1,n/2))	a = sum(1,n/2);
		if(a + b > n * (n + 1) / 2 || a > sum(n/2+1,n))	printf("-1\n");
		else{
			for(int i=1; i<=n; i++)	ans[i] = i;
			int now = sum(1,n/2);
			int r = n,l = 1;
			while(now != a && l <= n/2 && r >= n / 2 + 1){
				if(now + ans[r] - ans[l] <= a)	now = now + ans[r] - ans[l],swap(ans[l],ans[r]),l++,r--;
				else if(now + ans[r] - ans[n/2] > a)	r--;
				else{
					for(;now != a && l <= n/2; l++){
						if(now + ans[r] - ans[l] == a)	swap(ans[l],ans[r]),now = now + ans[r] - ans[l];
					}
					break;
				} 
			}
			for(int i=1; i<=n; i++)	printf("%lld ",ans[i]);
			printf("\n");
		}
	}
	return 0;
}

#include<bits/stdc++.h>
using namespace std;
const int N = 1e6+5;
struct edge{
	int nxt,to;
	edge(){}
	edge(int _nxt,int _to){
		nxt = _nxt,to = _to;
	}
}e[2 * N];
set<int> g,h,ans;
int sum[N],fa[N],a[N],head[N],cnt;
bool flag[N];
void add_edge(int from,int to){
	e[++cnt] = edge(head[from],to);
	head[from] = cnt;
}
void dfs(int now,int fath){
	fa[now] = fath;
	for(int i = head[now]; i;i = e[i].nxt){
		int to = e[i].to;
		if(to == fath)	continue;
		dfs(to,now);
	}
}
void dfs2(int now,int fath){
	for(int i = head[now]; i;i = e[i].nxt){
		int to = e[i].to;
		if(to == fath)	continue;
		dfs2(to,now);
		sum[now] += sum[to];
	}
}
void get_ans(int now,int fath){
	printf("%d ",now);
	for(int i = head[now]; i;i = e[i].nxt){
		int to = e[i].to;
		if(to == fath)	continue;
		if(sum[to])	ans.insert(to);
	}
	if(ans.empty())	return;
	int to = *ans.begin();ans.clear();
	get_ans(to,now);
}
void pushup(int now){
	while(now){
		now = fa[now];
		if(a[now] == -1)	break;
		else if(flag[now])	break;
		else	flag[now] = true;
	}
}
int main(){
//	freopen("in.txt","r",stdin);
//	freopen("out.txt","w",stdout);
	int n;scanf("%d",&n);
	for(int i=1; i<=n; i++)	scanf("%d",&a[i]);
	for(int i=1; i<n; i++){
		int from,to;scanf("%d%d",&from,&to);
		add_edge(from,to);add_edge(to,from);
	}
	dfs(1,0);
	for(int i=1; i<=n; i++)	if(a[i] == 1)	pushup(i);
	if(!flag[1] && a[1] == 1){
		printf("1\n");
		return 0;
	}
	if(a[1] == -1 || !flag[1])	return 0;
	g.insert(1);
	while(!g.empty()){
		bool tag = false;
		for(int now : g){
			for(int i = head[now]; i;i = e[i].nxt){
				int to = e[i].to;
				if(to == fa[now])	continue;
				if(a[to] == 1)	tag = true;
			}
		}
		if(tag){
			for(int now : g){
				for(int i = head[now]; i; i = e[i].nxt){
					int to = e[i].to;
					if(to == fa[now])	continue;
					if(a[to] == 1)	h.insert(to);
				}
			}
		}
		else{
			for(int now : g){
				for(int i = head[now]; i; i = e[i].nxt){
					int to = e[i].to;
					if(to == fa[now])	continue;
					if(a[to] != -1)	h.insert(to);
				}
			}
		}
		tag = false;
		for(int now : h)	if(flag[now])	tag = true;
		if(!tag){
			for(int now : h)	sum[now]++;
			h.clear();g.clear();
		}
		else{
			g.clear();
			for(int now : h)	if(flag[now])	g.insert(now);
			h.clear();
		}
	}
	dfs2(1,0);
	get_ans(1,0);
	return 0;
}