#include<bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
    int N,M,L,S,E;
    cin>>N>>M>>L>>S>>E;
    vector<vector<pair<int,int>>> G(N);
    for(int i=0;i<M;i++){
    	int a,b,c;
    	cin>>a>>b>>c;
    	a--;
    	b--;
    	G[a].push_back({b,c});
    	G[b].push_back({a,c});
    }
    set<int> T;
    for(int i=0;i<L;i++){
    	int a;
    	cin>>a;
    	T.insert(a-1);
    }
    vector<int> dist(N,1e18);
    dist[0] = 0;
    priority_queue<pair<int,int>,vector<pair<int,int>>,greater<pair<int,int>>> pq;
    pq.push({0,0});
    while(!pq.empty()){
    	int u,w;
    	tie(w,u) = pq.top();
    	pq.pop();
    	if(dist[u] != w) continue;
    	for(auto [v,x]:G[u])if(dist[v] > w+x){
    		dist[v] = w+x;
    		pq.push({dist[v],v});
    	}
    }
    for(int i=0;i<N;i++){
    	dist[i] = max(dist[i],S);
    	if(S <= dist[i] && dist[i] < S+E && T.count(i)){
    		dist[i]++;
    		pq.push({dist[i],i});
    	}
    	else{
    		dist[i] = 1e18;
    	}
    }
    //cout<<dist[N-1]<<endl;
    if(dist[N-1] > S+E) dist[N-1] = 1e18;
    else{
    	cout<<dist[N-1]<<endl;
    	return 0;
    }
    while(!pq.empty()){
    	int u,w;
    	tie(w,u) = pq.top();
    	pq.pop();
    	if(dist[u] != w) continue;
    	for(auto [v,x]:G[u])if(dist[v] > w+x){
    		dist[v] = w+x;
    		pq.push({dist[v],v});
    	}
    }
    cout<<(dist[N-1]+1 > 1e17 ? -1 : dist[N-1])<<endl;
}