from heapq import*
N,M,L,S,E=map(int,input().split())
gr=[[] for i in range(N*2)]
edge=[]
for i in range(M):
    a,b,t=map(int,input().split())
    gr[(a-1)*2].append(((b-1)*2,t))
    gr[(b-1)*2].append(((a-1)*2,t))
    gr[(a-1)*2+1].append(((b-1)*2+1,t))
    gr[(b-1)*2+1].append(((a-1)*2+1,t))
T=list(map(int,input().split()))
for t in T:
    gr[(t-1)*2].append(((t-1)*2+1,-1))
dist=[1<<60]*N*2
vert=[(0,0)]
while vert:
    dis,pos=heappop(vert)
    if dist[pos]!=1<<60:
        continue
    dist[pos]=dis
    for t,c in gr[pos]:
        nxt=dis+c
        if c==-1:
            if dis>=S+E:
                continue
            nxt=max(S,dis)+1
        heappush(vert,(nxt,t))
if dist[-1]>=1<<60:
    print(-1)
else:
    print(dist[-1])