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

//* ATCODER
#include<atcoder/all>
using namespace atcoder;
typedef modint998244353 mint;
//*/

/* BOOST MULTIPRECISION
#include<boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;
//*/

typedef long long ll;

#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define rrep(i, s, n) for (int i = (int)(n)-1; i >= (int)(s); i--)

template <typename T> bool chmin(T &a, const T &b) {
	if (a <= b) return false;
	a = b;
	return true;
}

template <typename T> bool chmax(T &a, const T &b) {
	if (a >= b) return false;
	a = b;
	return true;
}

template <typename T> T max(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmax(ret, a[i]);
	return ret;
}

template <typename T> T min(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmin(ret, a[i]);
	return ret;
}

template <typename T> T sum(vector<T> &a){
	T ret = 0;
	for (int i=0; i<(int)a.size(); i++) ret += a[i];
	return ret;
}

int main(){
	int n, m, l; cin >> n >> m >> l;
	ll s, e; cin >> s >> e;
	vector<bool> is_toilet(n);
	vector ikeru(n, vector<pair<int,ll>>(0));
	rep(i,0,m){
		int a, b;
		cin >> a >> b;
		a--; b--;
		ll t; cin >> t;
		ikeru[a].push_back(pair(b, t));
		ikeru[b].push_back(pair(a, t));
	}
	rep(i,0,l){
		int x; cin >> x;
		x--; 
		is_toilet[x] = 1;
	}

	vector<ll> d2(n, 1e18);
	priority_queue<pair<ll,int>> pq2;

	{
		priority_queue<pair<ll,int>> pq;
		vector<ll> d(n, 1e18);
		d[0] = 0;
		pq.push(pair(0, 0));
		while(!pq.empty()){
			auto [tmp, i] = pq.top();
			pq.pop();
			tmp = -tmp;
			if (tmp > d[i]) continue;
			for (auto [j, c]: ikeru[i]){
				if (chmin(d[j], c+tmp)){
					pq.push(pair(-d[j], j));
				}
			}
		}

		if (d[n-1] >= 1e17){
			cout << -1 << '\n';
			return 0;
		}

		rep(i,0,n){
			if(is_toilet[i]){
				if (d[i] < s+e){
					d2[i] = max(d[i], s) + 1;
					pq2.push(pair(-d2[i], i));
				}
			}
		}
	}

	{
		while(!pq2.empty()){
			auto [tmp, i] = pq2.top();
			pq2.pop();
			tmp = -tmp;
			if (tmp > d2[i]) continue;
			for (auto [j, c]: ikeru[i]){
				if (chmin(d2[j], c+tmp)){
					pq2.push(pair(-d2[j], j));
				}
			}
		}

		if (d2[n-1] >= 1e17){
			cout << -1 << '\n';
			return 0;
		}
		cout << d2[n-1] << endl;
		return 0;
	}

}