# 既にACされた方を大変参考にさせていただきました

import sys

def MI(): return map(int, sys.stdin.buffer.readline().split())
def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
inf = 10**16

import numpy as np
from scipy.sparse.csgraph import dijkstra
from scipy.sparse import csr_matrix

n, m, l = MI()
l -= 1
tt = np.array(LI(), dtype="i8")

if np.sum(tt == 0) >= n-1:
    print(0)
    exit()

uu, vv, cc = [], [], []
fin = [[False]*n for _ in range(n)]
for u, v, c in sorted(LLI(m), key=lambda x: x[2]):
    u, v = u-1, v-1
    if fin[u][v]: continue
    fin[u][v] = fin[v][u] = True
    uu.append(u)
    vv.append(v)
    cc.append(c)

uu = np.array(uu, dtype="i8")
vv = np.array(vv, dtype="i8")
cc = np.array(cc, dtype="i8")
gg = csr_matrix((cc, (uu, vv)), (n, n))
dd = dijkstra(gg, directed=False).astype("i8")

iscar = tt > 0
ans = inf
for g in range(n):
    cur = np.sum(tt*dd[g])*2+np.min(dd[l][iscar]-dd[g][iscar])
    if cur < ans: ans = cur

print(ans)