#include <bits/stdc++.h>
using namespace std;

const int MAXN = 1e5 + 1;

int cuplaj[MAXN], rosu[MAXN];
bool viz[MAXN];
vector<int> G[MAXN];

void dfs(int node, int prev) {
	for(auto nxt : G[node]) {
		if(nxt == prev) continue;
		
		dfs(nxt, node);
		if(!cuplaj[node] && !cuplaj[nxt]) {
			// Cuplam muchie (node, nxt)
			cuplaj[node] = nxt;
			cuplaj[nxt] = node;
		}
	}
}

void solve() {
	int n, x, y;
	cin >> n;
	
	for(int i = 1; i <= n * 2; i++) {
		G[i].clear();
		cuplaj[i] = 0;
		viz[i] = 0;
	}
	
	// Muchiile albe si negre
	for(int i = 1; i <= n * 2 - 2; i++) {
		cin >> x >> y;
		G[x].push_back(y);
		G[y].push_back(x);
	}
	
	// Muchiile rosii
	for(int i = 1; i <= n; i++) {
		cin >> x >> y;
		rosu[x] = y;
		rosu[y] = x;
	}
	
	// cuplam toate nodurile alternant
	dfs(1, 0);
	dfs(n + 1, 0);
	
	vector<int> ans;
	int node = rosu[1]; // folosim muchie rosie la inceput
	int nr = 0, rasp = 1;
	ans.push_back(1);
	
	while(true) {
		if(viz[node]) {
			rasp = 0;
			break;
		}
		
		viz[node] = 1;
		if(node == 1) // am gasit ciclul
			break;
		ans.push_back(node);
		
		nr = 1 - nr; // alternam tipul de muchii
		if(nr != 0)
			node = cuplaj[node];
		else
			node = rosu[node];
	}
	
	for(int i = 1; i <= n * 2 && rasp; i++)
		if(viz[i] == 0) // daca avem vreun nod care nu a fost vizitat => nu avem sol
			rasp = 0;
	
	for(auto nod : ans)
		cout << nod << ' ';
	cout << '\n';
}

int main() {
	ifstream cin("dungeon.in");
	ofstream cout("dungeon.out");
	
	int T;
	cin >> T;
	while(T--)
		solve();
	
	return 0;
}