#include<bits/stdc++.h>
#define lowbit(x) x&(-x)
#define rep(i, a, b) for(int i = a; i <= b; i ++ )
#define pre(i, a, b) for(int i = a; i >= b; i -- )
#define pii pair<int, int>
using namespace std;
const int N = 5e5 + 10;
int n, m, k, d;
vector<int>p[N];
int dis[N][2], st[N][2];
int a[N];
vector<int>path;
void bfs1()
{
	queue<pii>q;
	rep(i, 0, n)
	{
		rep(j, 0, 1)
		{
			dis[i][j] = 0x3f3f3f3f;
		}
	}
	rep(i, 1, k)
	{
		dis[a[i]][0] = 0;
		q.push({a[i], 0});
	}
	while(q.size())
	{
		auto [u, w] = q.front();
		q.pop();
		if(w == d) continue;
		for(auto j : p[u])
		{
			if(dis[j][(w + 1) & 1] < 1e9) continue;
			dis[j][(w + 1) & 1] = w + 1;
			q.push({j, w + 1});
		}
	}
}
void bfs2()
{
	queue<pii>q;
	rep(i, 0, n)
	{
		rep(j, 0, 1)
		{
			st[i][j] = 0x3f3f3f3f;
		}
	}
	st[1][0] = 0;
	q.push({1, 0});
	while(q.size())
	{
		auto [u, w] = q.front();
		q.pop();
		for(auto j : p[u])
		{
			if(st[j][(w + 1) & 1] < 1e9) continue;
			if(dis[j][(w + 1) & 1] < 1e9 && dis[j][(w + 1) & 1] <= w + 1) continue;
			st[j][(w + 1) & 1] = w + 1;
			q.push({j, w + 1});
		}
	}
}
void g(int u, int w)
{
	for(auto j : p[u])
	{
		if(st[j][(w - 1) & 1] == (w - 1))
		{
			path.push_back(j);
			g(j, w - 1);
			break;
		}
	}
}
void solve()
{
	path.clear();
	scanf("%d%d%d", &n, &m, &d);
	rep(i, 1, n) p[i].clear();
	rep(i, 1, m)
	{
		int u, v;
		scanf("%d%d", &u, &v);
		p[u].push_back(v);
		p[v].push_back(u);
	}
	scanf("%d", &k);
	rep(i, 1, k)
	{
		scanf("%d", &a[i]);
	}
	bfs1();
	bfs2();
	if(st[n][0] > 1e9 && st[n][1] > 1e9) printf("-1\n");
	else
	{
		printf("%d\n", min(st[n][0], st[n][1]));
		path.push_back(n);
		g(n, min(st[n][0], st[n][1]));
		reverse(path.begin(), path.end());
		for(auto it : path) printf("%d ", it);
		printf("\n");

	}
}
int main()
{
	int _;
	_ = 1;
	scanf("%d",&_);
	while(_ -- )
	{
		solve();
	}
	return 0;
}