n,m,k = map(int,input().split())
A = list(map(int,input().split()))
inf = 10**12
dis = [[inf]*n for i in range(n)]
for i in range(n):
    dis[i][i] = 0

for i in range(m):
    x,y,z = map(int,input().split())
    x,y = x-1,y-1
    dis[x][y] = dis[y][x] = z

for t in range(n):
    for i in range(n):
        for j in range(n):
            if dis[i][t] == inf or dis[t][j] == inf:
                continue
            dis[i][j] = min(dis[i][j],dis[i][t]+dis[t][j])

dp = [inf]*(1<<n)
for i in range(n):
    dp[1<<i] = A[i]
ans = inf
for i in range(1<<n):
    if dp[i] == inf:
        continue
    if bin(i).count("1") == k:
        ans = min(ans,dp[i])
    for j in range(n):
        if i >> j & 1:
            continue
        cost = dp[i]+A[j]
        d = inf
        for t in range(n):
            if i >> t & 1:
                d = min(d,dis[t][j])
        cost += d
        dp[i|1<<j] = min(dp[i|1<<j],cost)
print(ans)