import sys

# sys.setrecursionlimit(200005)
int1 = lambda x: int(x)-1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
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 = 10**16
md = 998244353
# md = 10**9+7

n, m, k = LI()
aa = LI()
to = [[] for _ in range(n)]

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])

dp = [inf]*(1 << n)
for u, a in enumerate(aa):
    dp[1 << u] = a

for s in range(1 << n):
    for u in range(n):
        if s >> u & 1: continue
        cost = inf
        for v in range(n):
            if s >> v & 1 and dist[u][v] < cost:
                cost = dist[u][v]
        dp[s | 1 << u] = min(dp[s | 1 << u], dp[s]+cost+aa[u])

popcnt = lambda x: bin(x).count("1")

ans = inf
for s in range(1 << n):
    if popcnt(s) == k and dp[s] < ans:
        ans = dp[s]

print(ans)