# oj t -c "python3 main.py"
import sys,math
from collections import defaultdict,deque
from itertools import combinations,permutations,accumulate,product
from bisect import bisect_left,bisect_right
from heapq import heappop,heappush,heapify
#from sortedcontainers import SortedList,SortedSet
def input():return sys.stdin.readline().rstrip()
def ii(): return int(input())
def ms(): return map(int, input().split())
def li(): return list(map(int,input().split()))
inf = pow(10,18)
mod = 998244353
#//////////////////////////////////
N,M,L,S,E = ms()
G = [set() for _ in range(N+1)]
for _ in range(M):
  u,v,c = ms()
  if u==v: continue
  G[u].add((v,c))
  G[v].add((u,c))
T = set(li())
H = []
heappush(H,(0,1,0))
dist = [[inf,inf] for _ in range(N+1)]
while H:
  c,v,f = heappop(H)
  if v==N and f==1:
    print(c)
    exit()
  if dist[v][f]<=c: continue
  dist[v][f] = c
  for v2,c2 in G[v]:
    if f==0 and v2 in T and c+c2<S+E:
      if dist[v2][1]<=max(c+c2,S)+1: continue
      heappush(H,(max(c+c2,S)+1,v2,1))
    else:
      if f==0 and c+c2>=S+E: continue
      if dist[v2][f]<=c+c2: continue
      heappush(H,(c+c2,v2,f))
print(-1)