N, M, K = map(int, input().split())
As = list(map(int, input().split()))
XYZs = [tuple(map(int, input().split())) for _ in range(M)]

INF = 10 ** 18

adj = [[INF] * N for _ in range(N)]
for X, Y, Z in XYZs:
    X -= 1; Y -= 1
    adj[X][Y] = adj[Y][X] = min(adj[X][Y], Z)

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

def calc(indices):
    dp = [INF] * (1 << K)
    dp[0] = 0
    for i in range(K):
        dp[1 << i] = 0
    for s in range(1, 1 << K):
        for i in range(K):
            if not s & (1 << i):
                continue
            for j in range(K):
                if s & (1 << j):
                    continue
                dp[s | (1 << j)] = min(dp[s | (1 << j)], dp[s] + adj[indices[i]][indices[j]])
    return dp[-1]

def popcnt(n):
    "https://atcoder.jp/contests/abc152/submissions/9619555"
    c = (n & 0x5555555555555555) + ((n >> 1) & 0x5555555555555555)
    c = (c & 0x3333333333333333) + ((c >> 2) & 0x3333333333333333)
    c = (c & 0x0f0f0f0f0f0f0f0f) + ((c >> 4) & 0x0f0f0f0f0f0f0f0f)
    c = (c & 0x00ff00ff00ff00ff) + ((c >> 8) & 0x00ff00ff00ff00ff)
    c = (c & 0x0000ffff0000ffff) + ((c >> 16) & 0x0000ffff0000ffff)
    c = (c & 0x00000000ffffffff) + ((c >> 32) & 0x00000000ffffffff)
    return c


answer = INF
for s in range(1 << N):
    if popcnt(s) != K:
        continue
    indices = []
    tmp = 0
    for i in range(N):
        if s & (1 << i):
            indices.append(i)
            tmp += As[i]
    tmp += calc(indices)
    answer = min(answer, tmp)

print(answer)