# bitDP
# 最短距離は
N,M,K = map(int,input().split())
lsA = list(map(int,input().split()))
INF = float('INF')
lsg = [[INF]*N for i in range(N)]
for i in range(M):
    X,Y,Z = map(int,input().split())
    X -= 1
    Y -= 1
    lsg[X][Y] = Z
    lsg[Y][X] = Z

for k in range(N):
    for i in range(N):
        for j in range(N):
            lsg[i][j] = min(lsg[i][j], lsg[i][k] + lsg[k][j])

dp = [INF]*(2**N)
dp[0] = 0
for a in range(N):
    dp[1<<a]=lsA[a]

for i in range(2**N):
    for j in range(N):
        cost = INF
        for k in range(N):
            if (i >> k) & 1:
                cost = min(cost,lsg[j][k])
        dp[i|(1<<j)] = min(dp[i|(1<<j)],dp[i]+cost+lsA[j])

ans = INF
for i in range(2**N):
    if bin(i).count('1') == K:
        ans = min(ans,dp[i])
print(ans)