# @EXPECTED_RESULTS@: WRONG_ANSWER, TIME_LIMIT_EXCEEDED
# Only works for unique shortest paths.
# n,m,p <= 10^5
from queue import PriorityQueue
n, m, p, gc = map(int, input().split())
ps = list(map(lambda x: int(x)-1, input().split()))
g = [[] for _ in range(n)]
for _ in range(m):
    u,v,c=map(int, input().split())
    g[u-1].append((v-1, c))
    g[v-1].append((u-1, c))

# Dijkstra
dist = [10**18] * n
q = PriorityQueue()
dist[0] = 0
q.put((0, 0))
while not q.empty():
    d, u = q.get()
    if d > dist[u]: continue
    dist[u] = d
    for v, c in g[u]:
        if d+c < dist[v]:
            q.put((d+c, v))

# Walk over tree
totaldist = sum(dist[u] for u in ps)
ans = totaldist
cnt = [0] * n
for u in ps: cnt[u] += 1
o = list(range(n))
o.sort(key=lambda u: dist[u], reverse=True)
for u in o:
    for v, c in g[u]: 
        if dist[v] == dist[u] + c:
            cnt[u] += cnt[v]
    ans = min(ans, totaldist + cnt[u] * (gc - dist[u]))

print(ans)