#include<bits/stdc++.h>

using namespace std;
typedef long long ll;
#define st first
#define nd second
#define pb push_back
const int N = 100 * 1000 + 7;
bool od[N];
vector<int> ed[N], pth, cura;
int wys[N], mwy[N], wh[N], oj[N];

bool DFSP(int v, int tar)
{
	od[v] = true;
	if(v == tar)
	{pth.pb(v); return true;}
	for(int i = 0; i < (int)ed[v].size(); ++i)
	{
		if(od[ed[v][i]]) continue;
		if(DFSP(ed[v][i], tar))
		{
			pth.pb(v);
			return true;
		}
	}
	return false;
}

void DFS(int v)
{
	mwy[v] = wys[v]; wh[v] = v;
	for(int i = 0; i < (int)ed[v].size(); ++i)
	{
		if(wys[ed[v][i]]) continue;
		wys[ed[v][i]] = wys[v] + 1; oj[ed[v][i]] = v;
		DFS(ed[v][i]);
		if(mwy[ed[v][i]] > mwy[v])
		{
			mwy[v] = mwy[ed[v][i]];
			wh[v] = ed[v][i];
		}
	}
}

inline void Pth(int a, int b, int n)
{
	pth.clear();
	DFSP(b, a);
	for(int i = 1; i <= n; ++i) od[i] = false;
}

void DoA(int a, int b, int tar, int d, int n)
{
	cura.clear();
	wys[tar] = 1; DFS(tar);
	while(cura.size() <= 10 * n)
	{
		int pa = a, pb = b;
		if(b == tar || a == tar) break;
		int il = mwy[a] - wys[a] + 1, cur = b, g = 0;
		for(int i = 1; i <= il; ++i)
		{
			if(mwy[cur] > mwy[g]) g = cur;
			cur = oj[cur];
		}
		if(mwy[a] >= d) g = tar;
		while(b != g)
		{
			cura.pb(wh[a]);
			a = wh[a]; b = oj[b];
		}
		if(b == tar || a == tar) break;

		il = mwy[b] - wys[b] + 1, cur = a, g = 0;
		for(int i = 1; i <= il; ++i)
		{
			if(mwy[cur] > mwy[g]) g = cur;
			cur = oj[cur];
		}
		if(mwy[b] >= d) g = tar;
		while(a != g)
		{
			cura.pb(wh[b]);
			b = wh[b]; a = oj[a];
		}
		if(b == tar || a == tar) break;
		if(pa == a && pb == b)
		{
			cura.pb(-1);
			return;
		}
	}
	for(int i = 1; i <= n; ++i)
	{
		wys[i] = 0; oj[i] = 0;
	}
}

int DoR(int a, int b, int tar, int d, int n)
{
	for(int i = 1; i <= n; ++i)
	{
		wys[i] = 0; oj[i] = 0;
	}
	cura.clear();
	wys[tar] = 1; DFS(tar);
	while(cura.size() <= 10 * n)
	{
		//cout << "p " << a << " " << b << "\n";
		int pa = a, pb = b;
		if(b == tar || a == tar) break;
		int il = mwy[a] - wys[a] + 1, cur = b, g = b;
		for(int i = 1; i <= il; ++i)
		{
			if(mwy[cur] > mwy[g]) g = cur;
			cur = oj[cur];
		}
		if(mwy[a] >= d) g = tar;
		while(b != g)
		{
			cura.pb(b);
			a = wh[a]; b = oj[b];
		}
		if(b == tar || a == tar) break;

		il = mwy[b] - wys[b] + 1; cur = a; g = a;
		for(int i = 1; i <= il; ++i)
		{
			if(mwy[cur] > mwy[g]) g = cur;
			cur = oj[cur];
		}
		if(mwy[b] >= d) g = tar;
		//cout << g << " " << mwy[b] << "\n";
		while(a != g)
		{
			cura.pb(a);
			b = wh[b]; a = oj[a];
		}
		if(b == tar || a == tar) break;
		if(pa == a && pb == b) return -1;
	}
	for(int i = 1; i <= n; ++i)
	{
		wys[i] = 0; oj[i] = 0;
	}
	reverse(cura.begin(), cura.end());
	if(a == tar) return b;
	return a;
}


void Solve() 
{
	int n, a, b, c, d, x, y, di;
	int dok;
	vector<int> ans, pab, pcd, pac;
	cin >> n;
	for(int i = 1; i <= n; ++i)
	{
		wys[i] = 0; od[i] = false;
		ed[i].clear();
	}
	for(int i = 1; i < n; ++i)
	{
		cin >> a >> b;
		ed[a].pb(b); ed[b].pb(a);
	}
	cin >> a >> b;
	cin >> c >> d;
	Pth(a, b, n); pab = pth;
	Pth(c, d, n); pcd = pth;
	Pth(a, c, n); pac = pth;
	for(int i = 0; i < (int)min(pab.size(), pac.size()); ++i)
		if(pab[i] == pac[i]) x = pab[i];
	reverse(pac.begin(), pac.end());
	for(int i = 0; i < (int)min(pcd.size(), pac.size()); ++i)
		if(pcd[i] == pac[i]) y = pcd[i];
	reverse(pac.begin(), pac.end());
	di = pab.size();
	DoA(a, b, x, di, n);
	ans = cura;
	dok = DoR(c, d, y, di, n);
	//cout << "\n " << dok << " " << x << " " << y << "\n";
	if(cura.size() + ans.size() > 10 * n || dok == -1 || (ans.size() > 0 && ans.back() == -1))
	{
		cout << -1 << "\n";
		return;
	}
	Pth(x, dok, n);
	for(int i = 1; i < (int)pth.size(); ++i) ans.pb(pth[i]);
	for(int i = 0; i < (int)cura.size(); ++i) ans.pb(cura[i]);
	if(ans.size() > 10 * n)
	{
		cout << -1 << "\n";
		return;
	}
	cout << ans.size() << "\n";
	for(int i = 0; i < (int)ans.size(); ++i)
		cout << ans[i] << " ";
	cout << "\n";
	for(int i = 1; i <= n; ++i)
	{
		wys[i] = 0; od[i] = false;
		ed[i].clear();
	}
	pth.clear(); cura.clear();
}

int main() 
{
	ios_base::sync_with_stdio(0); cin.tie(0);
	int _=1;
	cin >> _;
	while(_--) Solve();
}