N, M, L, S, E = map(int, input().split())
E = S+E
G = [[] for _ in range(N)]
for i in range(M):
    a, b, t = map(int, input().split())
    a -= 1
    b -= 1
    G[a].append((b, t))
    G[b].append((a, t))
T = list(map(int, input().split()))
T = [x-1 for x in T]

from heapq import heapify, heappop, heappush

def dijk(G, start=0):
    N = len(G)
    dist = [10**18]*N
    visited = [False]*N
    que = []
    dist[start] = 0
    heappush(que, (0, start))
    while que:
        _, now = heappop(que)
        if visited[now] == True:
            continue
        visited[now] = True
        for to, weight in G[now]:
            if dist[now] + weight < dist[to]:
                dist[to] = dist[now] + weight
                heappush(que, (dist[now] + weight, to))
    return dist

stt = 0
dist1 = dijk(G, stt)

Tok = []
for toilet in T:
    if dist1[toilet] < E:
        tim = max(dist1[toilet], S)
        Tok.append((toilet, tim))

if len(Tok) == 0:
    print(-1)
    exit()

dist2 = dijk(G, N-1)
ans = 10**18
for toilet, t1 in Tok:
    ttot = t1 + 1 + dist2[toilet]
    ans = min(ans, ttot)

if ans == 10**18:
    print(-1)
else:
    print(ans)