import sys
input = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 7)
inf = 20 * 10 ** 9


def pop_count(T):
    T = (T & 0x55555555) + ((T >> 1) & 0x55555555)
    T = (T & 0x33333333) + ((T >> 2) & 0x33333333)
    T = (T & 0x0F0F0F0F) + ((T >> 4) & 0x0F0F0F0F)
    T = (T & 0x00FF00FF) + ((T >> 8) & 0x00FF00FF)
    T = (T & 0x0000FFFF) + ((T >> 16) & 0x0000FFFF)
    return T


N, M, K = map(int, input().split())
A = tuple(map(int, input().split()))
G = [[inf] * N for _ in range(N)]
for i in range(N):
    G[i][i] = 0
for _ in range(M):
    a, b, c = map(int, input().split())
    a -= 1
    b -= 1
    G[a][b] = G[b][a] = c

for k in range(N):
    for i in range(N):
        if G[i][k] < inf:
            for j in range(N):
                if G[k][j] < inf:
                    G[i][j] = min(G[i][j], G[i][k] + G[k][j])

# memo[i, bit]: iにいて、bitの街を既に訪れている。追加コストの最小値
memo = [[inf] * (1 << N) for _ in range(N)]
for i in range(N):
    memo[i][0] = 0
for bit in range(1, 1 << N):
    pos = {i for i in range(N) if (bit >> i) & 1}
    for s in range(N):
        if s in pos:
            continue
        for t in range(N):
            if t in pos:
                memo[s][bit] = min(memo[s][bit], G[s][t])

# dp[i, bit]: bitに発電所設置、現在地iのコスト最小値
dp = [[inf] * (1 << N) for _ in range(N)]
for i in range(N):
    dp[i][1 << i] = A[i]
for bit in range(1, 1 << N):
    frm = []
    to = []
    for i in range(N):
        if (bit >> i) & 1:
            frm.append(i)
        else:
            to.append(i)
    for s in frm:
        for t in to:
            nbit = bit | (1 << t)
            dp[t][nbit] = min(dp[t][nbit], dp[s][bit] + A[t] + memo[t][bit])

ans = inf
for S in range(1, 1 << N):
    if pop_count(S) == K:
        for i in range(N):
            ans = min(ans, dp[i][S])
print(ans)