#include<iostream>
#include<queue>
#include<vector>
#include<cassert>
using namespace std;
int N,M,L,S,E;
vector<pair<int,int> >G[2<<17];
vector<long>f(int s)
{
	vector<long>ret(N,(long)1e18);
	ret[s]=0;
	priority_queue<pair<long,int> >Q;
	Q.push(make_pair(0,s));
	while(!Q.empty())
	{
		int u=Q.top().second;
		long d=-Q.top().first;
		Q.pop();
		if(ret[u]<d)continue;
		for(auto e:G[u])
		{
			int v=e.first;
			long nd=d+e.second;
			if(ret[v]>nd)
			{
				ret[v]=nd;
				Q.push(make_pair(-nd,v));
			}
		}
	}
	return ret;
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	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(make_pair(b,c));
		G[b].push_back(make_pair(a,c));
	}
	vector<long>s=f(0),T=f(N-1);
	long ans=1e18;
	for(int i=0;i<L;i++)
	{
		int t;cin>>t;t--;
		long v=max(s[t],(long)S);
		if(v<S+E)ans=min(ans,v+1+T[t]);
	}
	if(ans>=(long)1e18)ans=-1;
	cout<<ans<<endl;
}