N,M,K = map(int,input().split())
A = list(map(int,input().split()))
G = [[] for _ in range(N)]
for _ in range(M):
    x,y,z = map(int,input().split())
    x,y = x-1,y-1
    G[x].append((y,z))
    G[y].append((x,z))

def wf(G):
    N = len(G)
    INF = 10**20
    cost = [[INF]*N for _ in range(N)]
    for i in range(N):
        cost[i][i] = 0
    for s in range(N):
        for t,c in G[s]:
            cost[s][t] = c
            cost[t][s] = c
    for k in range(N):
        for i in range(N):
            for j in range(N):
                if cost[i][k]!=INF and cost[k][j]!=INF:
                    cost[i][j] = min(cost[i][j], cost[i][k] + cost[k][j])
    return cost

cost = wf(G)

B = [[] for _ in range(N+1)]
for bit in range(1<<N):
    B[bin(bit).count("1")].append(bit)

INF = 10**13
dp = [INF]*(1<<N)
dp[0] = 0
for i in range(K):
    for bit in B[i]:
        tdp = dp[bit]
        for j in range(N):
            if bit&(1<<j):
                continue
            if i == 0:
                dp[bit+(1<<j)] = min(dp[bit+(1<<j)],tdp+A[j])
            else:
                mincost = INF
                for k in range(N):
                    if bit&(1<<k):
                        mincost = min(mincost,cost[j][k])
                dp[bit+(1<<j)] = min(dp[bit+(1<<j)],tdp+A[j]+mincost)
ans = INF
for b in B[K]:
    ans = min(ans,dp[b])
print(ans)