# include <bits/stdc++.h>
using namespace std;
const int nmax = 1000005;
vector <int> g[nmax];
int vis[nmax],ids=1;
int dist[nmax][2];
void dijkstra(int v, bool fl,int k)
{
    queue < int > q;
    vis[v] = ids;
    dist[v][fl] = 0;
    q.push(v);
    int d,i;
    while(!q.empty())
    {
        v=q.front();
        q.pop();
        for(i=0;i<g[v].size();i++)
        {
            if(vis[g[v][i]]==ids)continue;
            vis[g[v][i]] = ids;
            dist[g[v][i]][fl] = dist[v][fl]+k;
            q.push(g[v][i]);
        }
    }
}
int P[nmax];
int IS[nmax],is=1;
stack <int> st;
int from[nmax];

bool dfs(int v)
{
    int s = v;
    queue <int> q;
    int i;
    vis[v]=ids;
    q.push(v);
    /*if(IS[v]==is){st.push(v);return true;}
    for(i=0;i<g[v].size();i++)
    {
        if(vis[g[v][i]]==ids)continue;
        if(dist[g[v][i]][0]<dist[g[v][i]][1])
        {
            if(dfs(g[v][i])){st.push(v);return true;}
        }

    }*/
    while(!q.empty())
    {
        v = q.front();
        q.pop();
        if(IS[v]==is)
        {
            st.push(v);
            while(v!=s)
            {
                st.push(from[v]);
                v=  from[v];
            }

            return true;
        }
          for(i=0;i<g[v].size();i++)
    {
        if(vis[g[v][i]]==ids)continue;
        if(dist[g[v][i]][0]<dist[g[v][i]][1])
        {
            vis[g[v][i]]=ids;
            from[g[v][i]]=v;
            q.push(g[v][i]);
        }

    }

    }
    return false;
}
void solve()
{
    int n,i,j,m;
    cin>>n>>m;
    for(i=1;i<=n;i++)
        g[i].clear();
        int a,b,s;
        cin>>a>>b>>s;
    for(i=1;i<=m;i++)
    {
        int u,v;
        cin>>u>>v;
        g[u].push_back(v);
        g[v].push_back(u);
    }
    int k;
    is++;
    cin>>k;
    for(i=1;i<=k;i++)
    {
          cin>>P[i];
          IS[P[i]]=is;
    }
//cout<<"OK"<<endl;
    ids++;
    dijkstra(s,0,b);
    ids++;
    dijkstra(P[1],1,a);
    ids++;
   // for(i=1;i<=n;i++)
   //     cout<<i<<" : "<<dist[i][0]<<" "<<dist[i][1]<<endl;
    if(!dfs(s)){cout<<-1<<endl;return ;}
    cout<<st.size()<<endl;
    while(!st.empty()){cout<<st.top()<<" ";st.pop();}
    cout<<endl;
    return ;

}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    freopen("escape.in","r",stdin);
    freopen("escape.out","w",stdout);

    int t;
    cin>>t;
    while(t--)
    {
        solve();
    }
}