import sys
input = lambda :sys.stdin.readline()[:-1]
ni = lambda :int(input())
na = lambda :list(map(int,input().split()))
sys.setrecursionlimit(10**7)
yes = lambda :print("yes");Yes = lambda :print("Yes");YES = lambda : print("YES")
no = lambda :print("no");No = lambda :print("No");NO = lambda : print("NO")
#######################################################################

from collections import defaultdict

class UnionFind():
    def __init__(self, n):
        self.n = n
        self.parents = [-1] * n

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

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

        if x == y:
            return

        if self.parents[x] > self.parents[y]:
            x, y = y, x

        self.parents[x] += self.parents[y]
        self.parents[y] = x

    def size(self, x):
        return -self.parents[self.find(x)]

    def same(self, x, y):
        return self.find(x) == self.find(y)

    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.parents) if x < 0]

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

    def all_group_members(self):
        group_members = defaultdict(list)
        for member in range(self.n):
            group_members[self.find(member)].append(member)
        return group_members

    def __str__(self):
        return '\n'.join(f'{r}: {m}' for r, m in self.all_group_members().items())


from itertools import combinations
n,m,K = na()
a = na()
INF = 10**18
ans = 10**18
cost = [[INF for j in range(n)]for i in range(n)]
for i in range(m):
    x,y,z = na()
    x-=1
    y-=1
    cost[x][y] = z
    cost[y][x] = z
V = n
# cost[i][j]: 頂点v_iから頂点v_jへ到達するための辺コストの和
for k in range(V):
    for i in range(V):
        for j in range(V):
            if cost[i][k]!=INF and cost[k][j]!=INF:
                cost[i][j] = min(cost[i][j], cost[i][k] + cost[k][j])

e = []
for i in range(n):
    for j in range(i+1,n):
        e.append((cost[i][j],i,j))
e = sorted(e)

for cm in combinations(range(n), K):
    s = sum([a[i] for i in range(n) if i in cm])
    uf = UnionFind(n)
    for z,x,y in e:
        if not(x in cm and y in cm):
            continue
        if uf.same(x,y):continue
        uf.union(x,y)
        s += z
    if uf.size(cm[0])!=K:
        print("!")
    else:
        ans = min(ans, s)
print(ans)
#print(ans)