#include <bits/stdc++.h>
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
const ll ILL=2167167167167167167;
const int INF=2100000000;
const int mod=998244353;
#define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++)
#define all(p) p.begin(),p.end()
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,T b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,T b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
bool yneos(bool a,bool upp=0){if(a){cout<<(upp?"YES\n":"Yes\n");}else{cout<<(upp?"NO\n":"No\n");}return a;}
template<class T> void vec_out(vector<T> &p,int ty=0){
if(ty==2){cout<<'{';for(int i=0;i<(int)p.size();i++){if(i){cout<<",";}cout<<'"'<<p[i]<<'"';}cout<<"}\n";}
else{if(ty==1){cout<<p.size()<<"\n";}for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}}
template<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}
template<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}
template<class T> T vec_sum(vector<T> &a){T ans=T(0);for(auto &x:a) ans+=x;return ans;}
int pop_count(long long a){int res=0;while(a){res+=(a&1),a>>=1;}return res;}
template<class T> bool inside(T l,T x,T r){return l<=x&&x<r;}



void solve();
// CYAN / FREDERIC
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    
    int t = 1;
    // cin >> t;
    rep(i, 0, t) solve();
}

void solve(){
    ll N, M, L, S, E;
    cin >> N >> M >> L >> S >> E;
    struct edge{
        int to;
        ll c;
    };
    vector<vector<edge>> G(N);
    rep(i, 0, M){
        int a, b;
        ll c;
        cin >> a >> b >> c;
        a--, b--;
        G[a].push_back({b, c});
        G[b].push_back({a, c});
    }
    auto f = [&](vector<ll> &ans) -> void {
        _pq<pair<ll, int>> pq;
        rep(i, 0, N) pq.push({ans[i], i});
        while (!pq.empty()){
            auto tmp = pq.top();
            pq.pop();
            if (ans[tmp.second] < tmp.first) continue;
            for (auto x : G[tmp.second]){
                if (chmin(ans[x.to], tmp.first + x.c)){
                    pq.push({ans[x.to], x.to});
                }
            }
        }
    };
    vector<ll> ans(N, ILL);
    ans[0] = 0;
    f(ans);
    vector<bool> ok(N);
    rep(i, 0, L){
        int a;
        cin >> a;
        ok[a - 1] = 1;
    }
    rep(i, 0, N){
        if (ok[i] && ans[i] < S + E){
            chmax(ans[i], S);
            ans[i]++;
        }
        else{
            ans[i] = ILL;
        }
    }
    f(ans);
    cout << (ans[N - 1] == ILL ? (ll)(-1) : ans[N - 1]) << "\n";
}