from heapq import *

N, M, L, S, E0 = map(int, input().split())
ABT = [list(map(int, input().split())) for _ in range(M)]
T = [i - 1 for i in list(map(int, input().split()))]
E = [[] for _ in range(N)]

for a, b, t in ABT:
    a -= 1;
    b -= 1
    E[a].append((b, t))
    E[b].append((a, t))

INF = 10 ** 15
D = [[INF] * N for _ in range(2)]


def dijkstra(st, idx):
    D[idx][st] = 0
    q = [(0, st)]
    while q:
        d, u = heappop(q)
        # 下のifでTLE解消することがある
        if d > D[idx][u]: continue
        for i in E[u]:
            a, b = i
            if D[idx][a] > D[idx][u] + b:
                D[idx][a] = D[idx][u] + b
                heappush(q, (D[idx][a], a))
    return


dijkstra(0, 0)
dijkstra(N - 1, 1)
ans = INF
for t in T:
    if D[0][t] > S + E0:
        continue
    if D[0][t] < S:
        ans = min(ans, S + 1 + D[1][t])
    else:
        ans = min(ans, D[0][t] + D[1][t] + 1)
if ans == INF:
    print(-1)
else:
    print(ans)