INF = 10 ** 12


def warshall_floyd(matrix):
    n = len(matrix)
    dist = [[d for d in row] for row in matrix]
    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])
    return dist


def cost(state, v):
    res = INF
    for nxt_v in range(n):
        if state & (1 << nxt_v):
            res = min(res, dist[v][nxt_v])
    if res == INF:
        return 0
    else:
        return res


n, m, k = map(int, input().split())
a = list(map(int, input().split()))
edges = [list(map(int, input().split())) for i in range(m)]


matrix = [[INF] * n for i in range(n)]
for i in range(n):
    matrix[i][i] = 0
for u, v, c in edges:
    u -= 1
    v -= 1
    matrix[u][v] = c
    matrix[v][u] = c
dist = warshall_floyd(matrix)

dp = [INF] * (1 << n)
dp[0] = 0

states = [bit_state for bit_state in range(1 << n)]
states = sorted(states, key=lambda x: bin(x).count("1"))

for bit_state in states:
    for new_v in range(n):
        if bit_state & (1 << new_v):
            continue
        new_state = bit_state | (1 << new_v)
        dp[new_state] = min(dp[new_state],
                            dp[bit_state] + a[new_v] + cost(bit_state, new_v))

ans = INF
for bit_state in states:
    if bin(bit_state).count("1") == k:
        ans = min(ans, dp[bit_state])
print(ans)