import sys
input = sys.stdin.readline
from math import *
inf = 10 ** 18

def dist(a, b):
    return max(0, sqrt((X[a] - X[b])**2 + (Y[a] - Y[b])**2) - R[a] - R[b])


def dijkstra(G, K2):
    ind = (0, 0)
    N = len(G)
    seen = [[0] * N for _ in range(K2)]
    D = [[inf] * N for _ in range(K2)]
    D[0][0] = 0
    while True:
        minv = inf
        for s in range(K2):
            for i in range(N):
                if seen[s][i]:
                    continue
                if D[s][i] < minv:
                    ind = (s, i)
                    minv = D[s][i]
        if ind == (K2-1, N-1):
            break
        
        seen[ind[0]][ind[1]] = 1
        s = ind[0]
        for i in range(N):
            if G[ind[1]][i] == inf:
                continue
            ns = s
            if RR[G[ind[1]][i][1]] != -1:
                ns = s | (1 << RR[G[ind[1]][i][1]])
            if seen[ns][i]:
                continue
            D[ns][i] = min(D[ns][i], D[ind[0]][ind[1]] + G[ind[1]][i][0])
                        
    return D[K2-1][N-1]


N, M, K = map(int, input().split())
R = list(map(int, input().split()))
RR = [-1] * M
for i in range(K):
    RR[R[i]-1] = i
    
G = [[inf] * N for _ in range(N)]
for i in range(M):
    A, B, C = map(int, input().split())
    A, B = A - 1, B - 1
    G[A][B] = (C, i)
    G[B][A] = (C, i)
    
print(dijkstra(G, 1 << K))