import sys
input = sys.stdin.readline
from heapq import *

def dijkstra(s):
    dist = [10**18]*N
    dist[s] = 0
    pq = []
    heappush(pq, (0, s))
    
    while pq:
        d, v = heappop(pq)
        
        if dist[v]<d:
            continue
        
        for nv, w in G[v]:
            if dist[nv]>dist[v]+w:
                dist[nv] = dist[v]+w
                heappush(pq, (dist[nv], nv))
    
    return dist

N, M, L = map(int, input().split())
t = list(map(int, input().split()))
s = sum(t)

if s in t:
    print(0)
    exit()

G = [[] for _ in range(N)]

for _ in range(M):
    a, b, c = map(int, input().split())
    G[a-1].append((b-1, c))
    G[b-1].append((a-1, c))

D = [dijkstra(i) for i in range(N)]
ans = 10**18

for i in range(N):
    base = 0
    
    for j in range(N):
        base += 2*t[j]*D[i][j]
    
    for j in range(N):
        cand = base+D[L-1][j]+D[j][i]
        
        if t[j]>=1:
            cand -= 2*D[i][j]
        
        ans = min(ans, cand)

print(ans)