#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define mp make_pair
#define si(x) int(x.size())
const int mod=998244353,MAX=300005;
const ll INF=15LL<<58;

vector<pair<int,ll>> G[MAX];
ll dis[MAX][2];
bool OK[MAX];

int main(){
    
    std::ifstream in("text.txt");
    std::cin.rdbuf(in.rdbuf());
    cin.tie(0);
    ios::sync_with_stdio(false);
    
    ll N,M,L,S,E;cin>>N>>M>>L>>S>>E;
    for(int i=0;i<M;i++){
        int a,b,c;cin>>a>>b>>c;
        a--;b--;
        G[a].push_back(mp(b,c));
        G[b].push_back(mp(a,c));
    }
    for(int i=0;i<L;i++){
        int x;cin>>x;x--;
        OK[x]=true;
    }
    
    for(int i=0;i<N;i++) dis[i][0]=dis[i][1]=INF;
    
    priority_queue<tuple<ll,int,int>,vector<tuple<ll,int,int>>,greater<tuple<ll,int,int>>> PQ;
    dis[0][0]=0;
    PQ.push({0,0,0});
    
    while(!PQ.empty()){
        auto [d,u,f]=PQ.top();PQ.pop();
        if(dis[u][f]<d) continue;
        for(auto [to,co]:G[u]){
            if(chmin(dis[to][f],d+co)) PQ.push({d+co,to,f});
        }
        if(f==0&&OK[u]&&d<S+E){
            chmax(d,S);
            if(chmin(dis[u][1],d+1)) PQ.push({d+1,u,1});
        }
    }
    
    if(dis[N-1][1]==INF) cout<<-1<<endl;
    else cout<<dis[N-1][1]<<endl;
}