from heapq import heappush, heappop
inf = float('inf')
def dijkstra(s, g, G):
    # ゴールがない場合はg=-1とする。

    N = len(G)

    def cost(v, m):
        return v * N + m

    dist = [inf] * N
    mindist = [inf] * N
    seen = [False] * N
    Q = [cost(0, s)]
    while Q:
        c, m = divmod(heappop(Q), N)
        if seen[m]:
            continue
        seen[m] = True
        dist[m] = c
        if m == g:
            return dist

        #------heapをアップデートする。--------
        for u, C in G[m]:
            if seen[u]:
                continue
            newdist = dist[m] + C

            #------------------------------------
            if newdist >= mindist[u]:
                continue
            mindist[u] = newdist
            heappush(Q, cost(newdist, u))
    return dist

N, M, L, S, E = map(int, input().split())
G = [[] for i in range(N)]
for i in range(M):
    u, v, c = map(int, input().split())
    u, v = u - 1, v - 1
    G[u].append((v, c))
    G[v].append((u, c))

T = list(map(int, input().split()))
D0 = dijkstra(0, -1, G)
DN = dijkstra(N - 1, -1, G)
if D0[-1] <= S + E - 1:
    print(max(S + 1, D0[-1] + 1))
    exit()
    
inf = 10 ** 18
ans = inf
for i in range(L):
    if D0[T[i]-1] >= S + E:
        continue
    ans = min(ans, max(S + 1, D0[T[i]-1] + 1) + DN[T[i]-1])
    
print(ans) if ans < inf//2 else print(-1)