#include<bits/stdc++.h>
#define IOS ios::sync_with_stdio(false),cin.tie(nullptr),cout.tie(nullptr)
#define int long long
#define ull unsigned long long
#define ii __int128
#define endl '\n'
#define pii pair<int,int>
#define fi first
#define se second
using namespace std;
const double pi=acos(-1.0);

const int N=2e5+5;
const int mod=998244353;

int inf=1e9;
int n,m,d;
int disa[N][2];//机器人,到i最小步数
int disb[N][2];//人,0偶数，1奇数
int pre[N][2];
basic_string<int>e[N];//边

void dij(){
	int k;cin>>k;
	queue<tuple<int,int>>q;//now,cnt
	for(int i=1,x;i<=k;++i){
		cin>>x;
		q.push({x,0});
		disa[x][0]=0;
	}
	while(q.size()){
		auto [u,cnt]=q.front();q.pop();
		//cout<<"dij:"<<u<<' '<<cnt<<endl;
		for(auto v:e[u])if(disa[v][(cnt+1)&1]>cnt+1&&cnt+1<=d){
			disa[v][(cnt+1)&1]=cnt+1;
			q.push({v,cnt+1});
		}
	}
}
void bfs(){
	queue<tuple<int,int>>q;
	q.push({1,0});
	disb[1][0]=0;
	while(q.size()){
		auto [u,cnt]=q.front();q.pop();
		if(u==n)return;
		for(auto v:e[u])
			if(disb[v][(cnt+1)&1]>cnt+1&&disa[v][(cnt+1)&1]>cnt+1){
				disb[v][(cnt+1)&1]=cnt+1;
				pre[v][(cnt+1)&1]=u;
				q.push({v,cnt+1});
			}
	}
}
void solve(){
	cin>>n>>m>>d;
	//init
	for(int i=1;i<=n;++i){
		disa[i][0]=disb[i][0]=inf;
		disa[i][1]=disb[i][1]=inf;
		pre[i][0]=pre[i][1]=0;
		e[i].clear();
	}
	//
	for(int i=1,x,y;i<=m;++i){
		cin>>x>>y;
		e[x]+=y;
		e[y]+=x;
	}
	dij();
	bfs();
	if(disb[n][0]==disb[n][1]&&disb[n][0]==inf){
		cout<<-1<<endl;
		return;
	}
	int u=n,pos=0;
	if(disb[n][1]<disb[n][0])pos^=1;
	vector<int>ans;
	while(u>0){
		ans.push_back(u);
		u=pre[u][pos];
		pos^=1;
	}
	reverse(ans.begin(),ans.end());
	cout<<ans.size()-1<<endl;
	for(auto i:ans)cout<<i<<' ';
	cout<<endl;
}
signed main(){
	IOS;
	int _=1;
	cin>>_;
	while(_--)
		solve();

	return 0;
}
/*
1
7 8 2
1 2
2 3
3 7
2 5
5 6
3 6
1 4
4 5
1 4
*/