"""

dp[bi] = 現在、biの中に建設されている時の最小コスト
あらかじめ全点対間をやっておく



"""


from sys import stdin
import sys

def popcnt(x):
    ret = 0
    while x > 0:
        ret += x % 2
        x //= 2
    return ret

N,M,K = map(int,stdin.readline().split())

A = list(map(int,stdin.readline().split()))

d = [[float("inf")] * N for i in range(N)]

for i in range(N):
    d[i][i] = 0

for i in range(M):

    X,Y,Z = map(int,stdin.readline().split())
    X -= 1
    Y -= 1

    d[X][Y] = min(d[X][Y],Z)
    d[Y][X] = min(d[Y][X],Z)

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

dp = [float("inf")] * (2**N)
for i in range(N):
    dp[2**i] = A[i]

for bi in range(2**N):

    for j in range(N):

        if (2**j) & bi > 0:
            continue

        nc = float("inf")
        for k in range(N):
            if (2**k) & bi > 0:
                nc = min(nc,d[j][k])
        dp[bi | (2**j)] = min(dp[bi | (2**j)] , dp[bi] + nc + A[j])

#print (dp)

ans = float("inf")
for i in range(2**N):
    if popcnt(i) == K:
        ans = min(ans,dp[i])

print (ans)