#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

#include <algorithm>
#include <atcoder/all>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using namespace atcoder;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--)
#define repk(i, k, n) for (int i = k; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define mod1 1000000007
#define mod2 998244353
#define mod3 100000007
#define vi vector<int>
#define vs vector<string>
#define vc vector<char>
#define vl vector<ll>
#define vb vector<bool>
#define vvi vector<vector<int>>
#define vvc vector<vector<char>>
#define vvl vector<vector<ll>>
#define vvb vector<vector<bool>>
#define vvvi vector<vector<vector<int>>>
#define vvvl vector<vector<vector<ll>>>
#define pii pair<int, int>
#define pil pair<int, ll>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define vpii vector<pair<int, int>>
#define vpll vector<pair<ll, ll>>
#define vvpii vector<vector<pair<int, int>>>
#define vvpll vector<vector<pair<ll, ll>>>

using mint = modint998244353;

template <typename T>
void debug(T e) {
    cerr << e << endl;
}

template <typename T>
void debug(vector<T> &v) {
    rep(i, v.size()) { cerr << v[i] << " "; }
    cerr << endl;
}

template <typename T>
void debug(vector<vector<T>> &v) {
    rep(i, v.size()) {
        rep(j, v[i].size()) { cerr << v[i][j] << " "; }
        cerr << endl;
    }
}

template <typename T>
void debug(vector<pair<T, T>> &v) {
    rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; }
}

template <typename T>
void debug(set<T> &st) {
    for (auto itr = st.begin(); itr != st.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(multiset<T> &ms) {
    for (auto itr = ms.begin(); itr != ms.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(map<T, T> &mp) {
    for (auto itr = mp.begin(); itr != mp.end(); itr++) {
        cerr << itr->first << " " << itr->second << endl;
    }
}

void debug_out() { cerr << endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << H << " ";
    debug_out(T...);
}

int main() {
    ll N, M, L, S, E;
    cin >> N >> M >> L >> S >> E;
    vector<ll> a(M);
    vector<ll> b(M);
    vector<ll> t(M);
    for (ll i = 0; i < M; i++) {
        cin >> a[i] >> b[i] >> t[i];
        a[i]--;
        b[i]--;
    }
    vector<ll> T(L);
    for (ll i = 0; i < L; i++) {
        cin >> T[i];
        T[i]--;
    }
    vector<bool> has_t(N, false);
    for (ll i = 0; i < L; i++) {
        has_t[T[i]] = true;
    }
    vector<vector<pll>> graph(2 * N, vector<pll>(0));
    for (ll i = 0; i < M; i++) {
        graph[a[i]].push_back(pll(b[i], t[i]));
        graph[b[i]].push_back(pll(a[i], t[i]));
        graph[a[i] + N].push_back(pll(b[i] + N, t[i]));
        graph[b[i] + N].push_back(pll(a[i] + N, t[i]));
    }

    priority_queue<pll, vector<pll>, greater<pll>> pque;
    ll INF = 10000000000000023;
    vector<ll> dist(2 * N, INF);
    pque.push(pll(0, 0));
    dist[0] = 0;

    while (pque.size()) {
        pll p = pque.top();
        pque.pop();
        ll now_d = p.first;
        ll now_e = p.second;
        // debug_out(now_d, now_e);
        if (dist[now_e] < now_d) {
            continue;
        }
        if (now_e < N) {
            if (has_t[now_e] && now_d < S + E) {
                ll next = max(now_d, S);
                dist[now_e + N] = next + 1;
                pque.push(pll(next + 1, now_e + N));
            }
        }
        for (ll i = 0; i < graph[now_e].size(); i++) {
            ll next_e = graph[now_e][i].first;
            ll next_d = graph[now_e][i].second;
            if (now_d + next_d < dist[next_e]) {
                dist[next_e] = now_d + next_d;
                pque.push(pll(now_d + next_d, next_e));
            }
        }
    }
    // debug(dist);
    if (dist[2 * N - 1] == INF) {
        cout << -1 << endl;
    } else {
        cout << dist[2 * N - 1] << endl;
    }
}