// @check-accepted: examples very-small small-n small-l rest
#include<bits/stdc++.h>
using namespace std;

const int MAXN=3001;
const int MAXB=151;

#define LOG(x) cerr<<(#x)<<" = "<<x<<"\n";
#define chkmn(a,b) (a)=min((a), (b))

int n,m,k,l,b;

int path[MAXN], tank[MAXN];
vector<int> adj[MAXN];
int dist[MAXN][MAXN];
int tankDist[MAXB][MAXB];

void bfs(int ind) {
    queue<int> q;
    q.push(ind);
    
    vector<int> vis(n+1);
    vis[ind]=1;
    
    for(int j=1;j<=n;++j) {
        dist[ind][j]=1e9;
    }
    dist[ind][ind]=0;
    
    while(!q.empty()) {
        int i=q.front();q.pop();
        for(auto j:adj[i]) {
            if(!vis[j]) {
                vis[j]=1;
                q.push(j);
                dist[ind][j]=dist[ind][i]+1;
            }
        }
    }
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    cin>>n>>m>>k;
    for(int i=0;i<m;++i) {
        int a,b;
        cin>>a>>b;
        adj[a].push_back(b);
        adj[b].push_back(a);
    }

    cin>>l;
    for(int i=0;i<l;++i) {
        cin>>path[i];
    }
        
    for(int i=1;i<=n;++i) {
        bfs(i);
    }

    cin>>b;
    for(int i=0;i<b;++i) {
        cin>>tank[i];
        
    }

    for(int i=0;i<b;++i) {
        tankDist[i][i]=0;
        for(int j=0;j<b;++j) {
            tankDist[i][j]=1e9;
            if(dist[tank[i]][tank[j]]<=k) {
                tankDist[i][j]=dist[tank[i]][tank[j]];
            }
        } 
    }

    for(int j=0;j<b;++j) {
        for(int i=0;i<b;++i) {
            for(int k=0;k<b;++k) {
                chkmn(tankDist[i][k], tankDist[i][j]+tankDist[j][k]);
            }
        }
    }

    vector<int> dp_prv, dp_nxt;
    dp_prv.assign(k+1, 1e9);
    dp_prv[k]=0;
    for(int i=1;i<l;++i) {
        dp_nxt.assign(k+1, 1e9);
        int need=dist[path[i-1]][path[i]];
        for(int j=need;j<=k;++j) {
            chkmn(dp_nxt[j-need], dp_prv[j]+need);
        }
        for(int j=k-1;j>=0;j--) {
            chkmn(dp_prv[j], dp_prv[j+1]);
        }

        for(int first_tank=0;first_tank<b;++first_tank) {
            for(int last_tank=0;last_tank<b;++last_tank) {
                if(tankDist[first_tank][last_tank]>=1e9) continue ;
                int while_tank=tankDist[first_tank][last_tank];
                int before_tank=dist[path[i-1]][tank[first_tank]];
                int after_tank=dist[path[i]][tank[last_tank]];
                int with_tank=k-after_tank;
                if(with_tank>=0 && before_tank<=k) {
                    chkmn(dp_nxt[with_tank], dp_prv[before_tank]+before_tank+while_tank+after_tank);
                }
            }
        }
        dp_prv.swap(dp_nxt);
    }

    int ans=*min_element(begin(dp_prv), end(dp_prv));
    if(ans>=1e9) {
        ans=-1;
    }
    cout<<ans<<"\n";
    
    return 0;
}