## https://yukicoder.me/problems/no/1690


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

    # 2点間の距離を求める
    dist_matrix = [[float("inf")] * N for _ in range(N)]
    for i in range(N):
        dist_matrix[i][i] = 0
    for x, y, z in edges:
        dist_matrix[x][y] = z
        dist_matrix[y][x] = z
    for k in range(N):
        for i in range(N):
            for j in range(N):
                dist_matrix[i][j] = min(dist_matrix[i][j], dist_matrix[i][k] + dist_matrix[k][j])
    
    answer_cost = float("inf")
    for bit in range(2 ** N):
        count = 0
        array = []
        cost = 0
        for i in range(N):
            if bit >> i & 1:
                cost += A[i]
                count += 1
                array.append(i)
        
        if count == K:
            for i0 in range(len(array)):
                min_cost = float("inf")
                for i1 in range(i0):
                    min_cost = min(min_cost, dist_matrix[array[i0]][array[i1]])
                if min_cost < float("inf"):
                    cost += min_cost
            answer_cost = min(answer_cost, cost)
    print(answer_cost)

        
    



if __name__ == "__main__":
    main()