#include<bits/stdc++.h>
using namespace std;
constexpr int M=5e5+5;
vector<int>adj[M];
int n,m,d,k;
int lim[M],dis[M],pre[M];
int read(){
    int x=0;char ch=getchar();
    while (!isdigit(ch)) ch=getchar();
    while (isdigit(ch)) x=x*10+ch-48,ch=getchar();
    return x;
}
void solve(){
    n=read();m=read();d=read();
    for (int i=1;i<=n<<1;i++) adj[i].clear();
    for (int i=1;i<=n<<1;i++) lim[i]=dis[i]=-1,pre[i]=0;
    for (int i=1;i<=m;i++){
        int x=read(),y=read();
        adj[x].emplace_back(y+n);
        adj[y+n].emplace_back(x);
        adj[y].emplace_back(x+n);
        adj[x+n].emplace_back(y);
    } k=read();
    queue<int>q;
    for (int i=1;i<=k;i++){
        int x=read();
        q.emplace(x);lim[x]=0;
    }
    while (!q.empty()){
        int x=q.front();q.pop();
        if (lim[x]==d) continue;
        for (auto y:adj[x]) if (!~lim[y])
            lim[y]=lim[x]+1,q.emplace(y);
    }
    for (int i=1;i<=n<<1;i++)
        if (!~lim[i]) lim[i]=INT_MAX;
    q.emplace(1);dis[1]=pre[1]=0;
    while (!q.empty()){
        int x=q.front();q.pop();
        for (auto y:adj[x])
            if (!~dis[y]&&dis[x]+1<lim[y])
                dis[y]=dis[x]+1,pre[y]=x,q.emplace(y);
    }
    if (dis[n]==-1&&dis[n<<1]==-1)
        return puts("-1"),void();
    int pos=n;
    if (dis[n]<0||dis[n<<1]<dis[n]&&dis[n<<1]>=0)
        pos=n<<1;
    vector<int>ans;
    for (int i=pos;i;i=pre[i])
        ans.emplace_back(i);
    reverse(ans.begin(),ans.end());
    printf("%d\n",dis[pos]);
    for (auto x:ans) printf("%d ",x<=n?x:x-n);
    puts("");
}
int main(){int T=read();while (T--) solve();return 0;}