def popcount(n):
    cnt = 0
    while n:
        cnt += n & 1
        n //= 2
    return cnt

N, M, K = map(int, input().split())
A = list(map(int, input().split()))
inf = 10 ** 18
G = [[inf] * N for i in range(N)]
for i in range(M):
    X, Y, Z = map(int, input().split())
    X, Y = X - 1, Y - 1
    G[X][Y] = Z
    G[Y][X] = Z
    
for k in range(N):
    for i in range(N):
        for j in range(N):
            G[i][j] = min(G[i][j], G[i][k] + G[k][j])
            
N2 = 1 << N
dp = [inf] * N2
for i in range(N):
    dp[1 << i] = A[i]
    
for s in range(1, N2):
    for i in range(N):
        if (s >> i) & 1:
            continue
        d = inf
        for j in range(N):
            if (s >> j) & 1:
                d = min(d, G[i][j])                
        dp[s | 1 << i] = min(dp[s | 1 << i], dp[s] + A[i] + d)
     
ans = inf   
for s in range(1, N2):
    if popcount(s) == K:
        ans = min(ans, dp[s])
print(ans)