import sys
input = sys.stdin.readline

N,M,K=map(int,input().split())
A=list(map(int,input().split()))


Distance=[[float("inf") for i in range(N)] for j in range(N)]

for i in range(N):
    Distance[i][i]=0

for i in range(M):
    x,y,z=map(int,input().split())
    x-=1
    y-=1

    Distance[x][y]=min(Distance[x][y],z)
    Distance[y][x]=min(Distance[y][x],z)

for k in range(N): # k個までの町を使ってのDisが知れているときに
    for i in range(N): # 町iと
        for j in range(i,N): # 町jとの最短距離は、
            length=Distance[i][k]+Distance[j][k]
            if Distance[i][j]>length:
                Distance[i][j]=Distance[j][i]=length

DP=[1<<60]*(1<<N)
DP[0]=0

for i in range(1,1<<N):
    c=0
    for j in range(N):
        if i & (1<<j) != 0:
            c+=1

    if c==1:
        for j in range(N):
            if i & (1<<j) !=0:
                DP[i]=A[j]
                break
    else:
        for j in range(N):
            if i & (1<<j) == 0:
                continue

            MINDIS=1<<60

            for k in range(N):
                if j!=k and (i & (1<<k) != 0):
                    MINDIS=min(MINDIS,Distance[j][k])

            DP[i]=min(DP[i],DP[i^(1<<j)]+A[j]+MINDIS)

ANS=1<<60
for i in range(1,1<<N):
    c=0
    for j in range(N):
        if i & (1<<j) != 0:
            c+=1

    if c==K:
        ANS=min(ANS,DP[i])

print(ANS)