#include<bits/stdc++.h>
#define endl '\n'
using namespace std;
typedef long long ll;
ll i,j,p,p1,n,m,k,G,E,s,r[1000006],tt,t,iz[1000006],r1[1000006];
bool b[1000006],gfl,izh[1000006];
vector <int> v[1000006],ans,Ans;
struct Dv
{
    ll l,r;
}t1;
queue <Dv> q;
void bfs(ll u)
{
    fill(b+1,b+n+1,0);
    //b[u]=1;
    q.push({u,0});
    while(!q.empty())
    {
        t1=q.front();q.pop();
        if(b[t1.l]==0)
        {
            //fout<<t1.l<<" "<<t1.r<<endl;
            b[t1.l]=1;
            r[t1.l]=t1.r*G;
            for(ll j:v[t1.l])
            {
                if(!b[j])
                {
                    q.push({j,t1.r+1});
                }
            }
        }
    }
}
void bfs2(ll u)
{
    fill(b+1,b+n+1,0);
    //b[u]=1;
    q.push({u,0});
    while(!q.empty())
    {
        t1=q.front();q.pop();
        if(b[t1.l]==0)
        {
            //fout<<t1.l<<" "<<t1.r<<endl;
            b[t1.l]=1;
            r1[t1.l]=t1.r*E;
            for(ll j:v[t1.l])
            {
                if(!b[j])
                {
                    q.push({j,t1.r+1});
                }
            }
        }
    }
}
bool prv(ll a,ll b,ll c,ll d)
{
    //fout<<a<<" "<<b<<" "<<c<<" "<<d<<endl;
    if(d>c)
    {
        return (d<=b);
    }
    else
    {
        return (c<=b);
    }
}
void dfs(int u)
{
    //if(gfl==1)return ;
    //fout<<u<<endl;
    ans.push_back(u);
    b[u]=1;
    if(izh[u]){Ans=ans;gfl=1;return ;}
    for(int &j:v[u])
    {
        //fout<<u<<" "<<j<<endl;
        if(!b[j]  &&  prv(r[u],r[j],r1[u],r1[j])==0)
            dfs(j);
        if(gfl==1)break;
    }
    ans.pop_back();
}
ifstream fin("escape.in");
ofstream fout("escape.out");
int  main()
{

    ios_base::sync_with_stdio(false);
    fin.tie(NULL);
    fout.tie(NULL);

    fin>>t;
    for(tt=1; tt<=t; tt++)
    {
        fin>>n>>m>>E>>G>>s;gfl=0;
        for(i=1; i<=m; i++)
        {
            fin>>p>>p1;
            v[p].push_back(p1);
            v[p1].push_back(p);
        }
        fin>>k;
        for(i=1; i<=k; i++)
        {
            fin>>iz[i];
            izh[iz[i]]=1;
        }
        bfs(s);
        bfs2(iz[1]);
        /**for(i=1;i<=n;i++)
            fout<<r[i]<<" "<<r1[i]<<endl;*/
        fill(b+1,b+n+1,0);
        dfs(s);
        if(gfl)
        {
            fout<<Ans.size()<<endl;
            for(ll j:Ans)
                fout<<j<<" ";
            fout<<endl;
            ans.clear();Ans.clear();
        }
        else fout<<-1<<endl;
        for(i=1;i<=n;i++)
        {
            izh[i]=0;
            v[i].clear();
        }
    }
    return 0;
}
/**
3
8 9 3 2 1
1 2
1 3
2 3
2 4
3 4
4 5
4 6
4 7
2 8
4
5 6 7 8
7 8 3 2 1
1 2
1 3
2 3
2 4
3 4
4 5
2 6
3 7
3
5 6 7
7 8 3 2 1
1 2
1 3
2 3
2 4
3 4
4 5
4 6
4 7
3
5 6 7

1
8 8 2 2 1
1 2
2 3
1 4
1 5
5 6
3 6
3 7
7 8
2
4 8

*/