import sys

# sys.setrecursionlimit(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()
dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
inf = (1 << 63)-1
# inf = (1 << 31)-1
# md = 10**9+7
md = 998244353

n, m, k = LI()
aa = LI()

dist = [[inf]*n for _ in range(n)]
for u in range(n): dist[u][u] = 0
for _ in range(m):
    u, v, z = LI()
    u, v = u-1, v-1
    dist[u][v] = dist[v][u] = z

for v in range(n):
    for u in range(n):
        for w in range(n):
            dist[u][w] = min(dist[u][w], dist[u][v]+dist[v][w])

def popcnt(a): return bin(a).count("1")

dp = [inf]*(1 << n)
ans = inf
for s in range(1, 1 << n):
    pc = popcnt(s)
    if pc == 1:
        dp[s] = aa[s.bit_length()-1]
    if pc == k: ans = min(ans, dp[s])
    for u in range(n):
        if s >> u & 1: continue
        ns = s | 1 << u
        cost = min(dist[u][v] for v in range(n) if s >> v & 1)+aa[u]
        dp[ns] = min(dp[ns], dp[s]+cost)

print(ans)