#include<bits/stdc++.h>
#include<fstream>
using namespace std;

    ifstream fin("escape.in");
    ofstream fout("escape.out");


int const maxn = 1000005;

int n,m,a,b,s,k;
vector<int>v[maxn];
long long used[maxn];
long long gused[maxn];
int e[maxn];
bool eused[maxn];

void read()
{
    fin>>n>>m>>a>>b>>s;
    swap(a,b);
    int i,x,y;

    for(i=1;i<=n;i++)
        v[i].clear();
    memset(used,0,sizeof(used));
    memset(gused,0,sizeof(gused));
    memset(eused,0,sizeof(eused));

    for(i=0; i<m; i++)
    {
        fin>>x>>y;
        v[x].push_back(y);
        v[y].push_back(x);
    }

    fin>>k;
    for(i=0; i<k; i++)
    {
        fin>>e[i];
        eused[e[i]] = true;
    }
}

void bfs_e()
{
    queue<int>q;
    q.push(e[0]);
    used[e[0]] = 1;

    while(!q.empty())
    {
        int t = q.front();
        q.pop();

        int j,sz=v[t].size();
        for(j=0; j<sz; j++)
        {
            int nxt = v[t][j];
            if(!used[nxt])
            {
                used[nxt] = used[t] + b;
                q.push(nxt);
            }
        }
    }
}

int head[maxn];
int bfs_g()
{
    queue<int>q;
    gused[s] = 1;
    q.push(s);

    while(!q.empty())
    {
        int t = q.front();
        q.pop();

        int j, sz = v[t].size();
        for(j=0; j<sz; j++)
        {
            int nxt = v[t][j];
            //cout<<used[nxt]<<" "<<gused[t] + a<<endl;
            if(!gused[nxt] && used[nxt] > gused[t] + a)
            {
                gused[nxt] = gused[t] + a;
                q.push(nxt);
                head[nxt] = t;
                if(eused[nxt]) return nxt;
            }
        }
    }

    return -1;
}

void solve()
{
    bfs_e();
    int ans = bfs_g();

    if(ans == -1)
    {
        fout<<ans<<"\n";
        return ;
    }

    stack<int>st;
    int i = ans;
    while(i != s)
    {
        st.push(i);
        i = head[i];
    }
    st.push(s);

    fout<<st.size()<<"\n";
    while(!st.empty())
    {
        fout<<st.top()<<" ";
        st.pop();
    }
    fout<<"\n";
}


int main()
{
    int t,i;

    fin>>t;

    for(i=0;i<t;i++)
    {
        read();
        solve();
    }
	return 0;
}

/*

2
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

*/