N,M,K = map(int,input().split())
A = list(map(int,input().split()))
inf = 10 ** 12
dist = [[inf] * N for _ in range(N)]
for _ in range(M):
    x,y,z = map(int,input().split())
    x -= 1
    y -= 1
    dist[x][y] = z
    dist[y][x] = z
for i in range(N):
    dist[i][i] = 0
for k in range(N):
    for j in range(N):
        for i in range(N):
            if dist[i][j] > dist[i][k] + dist[k][j]:
                dist[i][j] = dist[i][k] + dist[k][j]
dp = [inf] * (1 << N)
for i in range(N):
    mask = 1 << i
    dp[mask] = A[i]
for bit in range(1, 1 << N):
    for i in range(N):
        mask = 1 << i
        if bit & mask == 0:
            continue
        b = bit ^ mask
        _min = inf
        index = -1
        for j in range(N):
            if b & (1 << j):
                if dist[i][j] < _min:
                    _min = dist[i][j]
                    index = j
        if dp[bit] > dp[b] + _min + A[i]:
            dp[bit] = dp[b] + _min + A[i]
ans = inf
for bit in range(1, 1 << N):
    if bin(bit).count('1') == K:
        if ans > dp[bit]:
            ans = dp[bit]
print(ans)