import sys
from operator import itemgetter
from collections import defaultdict, deque
import heapq
import bisect
import math
import itertools

stdin=sys.stdin
sys.setrecursionlimit(10 ** 8)

ip=lambda: int(sp())
fp=lambda: float(sp())
lp=lambda:list(map(int,stdin.readline().split()))
sp=lambda:stdin.readline().rstrip()
Yp=lambda:print('Yes')
Np=lambda:print('No')
inf = 1 << 60
inf1 = float('inf')
eps = 1e-9
sortkey1 = itemgetter(0)
sortkey2 = lambda x: (x[0], x[1])

from collections import Counter

class union_find():
    def __init__(self,n):
        self.n=n
        ##親要素のノード番号を格納。par[x]==xのときそのノードは根
        ##親とはその上にノードなし！！　
        self.par=[-1 for i in range(n)]
        self.rank=[0]*(n)

    def find(self,x):
        if self.par[x]<0:
            return x
        else:
            self.par[x]=self.find(self.par[x])
            
            return self.par[x]

    def union(self,x,y):
        x=self.find(x)
        y=self.find(y)

        ##木の高さを比較し、低い方から高い方へ辺をはる
        if x==y:
          return

        if self.par[x]>self.par[y]:
          x,y=y,x
          
        self.par[x]+=self.par[y]
        self.par[y]=x

    ##２つが同じ親かどうか
    def same(self,x,y):
        return self.find(x) == self.find(y)
    
    ##所属のサイズ
    def size(self,x):
      return -self.par[self.find(x)]
      
    ##同じ親のものを表示
    def members(self,x):
      root=self.find(x)
      return [i for i in range(self.n) if self.find(i)==root]
    
    ##親を表示！！
    def roots(self):
      return [i for i, x in enumerate(self.par) if x<0]
    
    def all_group_member(self):
      return {r:self.members(r) for r in self.roots()}

    def group_count(self):
      return len(self.roots())

## uf memo
## 素集合に分けるが、各集合には親というIDが振られているという意識を持つ！！（ABC049_Dより）

###############################################################

N, M, K = lp()
A = lp()
route = [[inf1 for _ in range(N)] for _ in range(N)]

for _ in range(M):
    x, y, z = lp()
    x -= 1; y -= 1
    route[x][y] = z
    route[y][x] = z
for i in range(N):
    route[i][i] = 0

for mid in range(N):
    for s in range(N):
        for g in range(N):
            route[s][g] = min(route[s][g], route[s][mid] + route[mid][g])
adj = []
for s in range(N - 1):
        for t in range(s + 1, N):
            adj.append((route[s][t], s, t))

adj.sort()

ans = inf1

for bit in range(2 ** N):
    one = 0
    temp = 0
    for i in range(N):
        if (bit >> i) & 1:
            one += 1
            temp += A[i]
    if one != K:
        continue

    uf = union_find(N)
    for cost, x, y in adj:
        if (bit >> x) & 1 and (bit >> y) & 1   and  not uf.same(x, y):
            temp += cost
            uf.union(x, y)
            if uf.size(x) == K:
                break
    ans = min(ans, temp)

print(ans)