n, m, K = map(int, input().split())
A = list(map(int, input().split()))
inf = 1 << 60
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 k in range(n):
    for i in range(n):
        for j in range(n):
            dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j])

dp = [inf] * (1 << n)
for i in range(n):
    dp[1 << i] = A[i]
ans = inf
for bit in range(1, 1 << n):
    for i in range(n):
        if not bit >> i & 1:
            continue
        for j in range(n):
            if i == j or not bit >> j & 1:
                continue
            dp[bit] = min(dp[bit], dp[bit ^ (1 << j)] + dist[i][j] + A[j])
    
    if bin(bit).count("1") == K:
        ans = min(ans, dp[bit])

print(ans)