#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ll long long
const int N = 2e5 + 10;
const int maxn = 1e6 + 10;
const int inf = 0x3f3f3f3f;

struct egde
{
    int to, ne;
} e[maxn];
int head[N], ecnt;

void add(int x, int y)
{
    e[++ecnt].to = y;
    e[ecnt].ne = head[x];
    head[x] = ecnt;
}

int f[N][2], v[N][2], pre[N][2];

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int T;
    cin >> T;
    while (T--)
    {
        int n, m, d;
        cin >> n >> m >> d;
        ecnt = 0;
        for (int i = 1; i <= n; i++)
            head[i] = 0;

        for (int i = 1; i <= m; i++)
        {
            int x, y;
            cin >> x >> y;
            add(x, y), add(y, x);
        }
        for (int i = 0; i <= n; i++)
        {
            f[i][0] = f[i][1] = -1;
            v[i][0] = v[i][1] = -1;
            pre[i][0] = pre[i][1] = 0;
        }
        queue<pair<int, int>> q;
        int k;
        cin >> k;
        for (int i = 1; i <= k; i++)
        {
            int x;
            cin >> x;
            q.push({x, 0});
            f[x][0] = 0;
        }
        while (!q.empty())
        {
            auto [x, t] = q.front();
            q.pop();
            for (int i = head[x]; i; i = e[i].ne)
            {
                int y = e[i].to;
                if (f[y][t ^ 1] == -1 && f[x][t] + 1 <= d)
                {
                    f[y][t ^ 1] = f[x][t] + 1;
                    q.push({y, t ^ 1});
                }
            }
        }
        q.push({1, 0});
        v[1][0] = 0;
        while (!q.empty())
        {
            auto [x, t] = q.front();
            q.pop();
            for (int i = head[x]; i; i = e[i].ne)
            {
                int y = e[i].to;
                if (v[y][t ^ 1] != -1)
                    continue;
                if (f[y][t ^ 1] == -1 || f[y][t ^ 1] > v[x][t] + 1)
                {
                    v[y][t ^ 1] = v[x][t] + 1;
                    pre[y][t ^ 1] = x;
                    q.push({y, t ^ 1});
                }
            }
        }

        int ans = inf, type = -1;
        for (auto y : {0, 1})
        {
            if (v[n][y] != -1 && v[n][y] < ans)
            {
                ans = v[n][y];
                type = y;
            }
        }
        if (ans == inf)
        {
            cout << -1 << endl;
            continue;
        }
        cout << ans << endl;
        vector<int> out;
        int root = n;
        while (root != 1 || type != 0)
        {
            out.push_back(root);
            root = pre[root][type];
            type ^= 1;
        }
        out.push_back(1);
        reverse(out.begin(), out.end());
        for (auto x : out)
            cout << x << ' ';
        cout << endl;
    }
}