#include <bits/stdc++.h>
using namespace std;
using ll = long long;

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n, m, l, s, e;
    cin >> n >> m >> l >> s >> e;
    vector<vector<pair<int,int>>> g(n);
    vector<bool> toilet(n);
    vector<vector<ll>> dp(2, vector<ll>(n, 1ll << 61));
    priority_queue<tuple<ll,int,int>, vector<tuple<ll,int,int>>, greater<tuple<ll,int,int>>> pq;
    for(int i = 0; i < m; i++){
        int u, v, c;
        cin >> u >> v >> c;
        u--, v--;
        g[u].emplace_back(v, c);
        g[v].emplace_back(u, c);
    }
    for(int i = 0; i < l; i++){
        int v;
        cin >> v;
        toilet[--v] = true;
    }
    dp[0][0] = 0;
    pq.emplace(0, 0, 0);
    while(!pq.empty()){
        auto [d, st, v] = pq.top();
        pq.pop();
        if(d > dp[st][v]) continue;
        if(st == 0 && toilet[v] && d < s + e){
            ll t = max((ll)s, d) + 1;
            if(t < dp[1][v]){
                dp[1][v] = t;
                pq.emplace(t, 1, v);
            }
        }
        for(auto [u, c] : g[v]){
            if(d + c >= dp[st][u]) continue;
            dp[st][u] = d + c;
            pq.emplace(dp[st][u], st, u);
        }
    }
    ll ans = dp[1][n - 1];
    if(ans >> 61 & 1) ans = -1;
    cout << ans << '\n';
}