INF = 10 ** 18
def dijkstra(s, n, graph):
    import heapq
    dist = [INF] * n
    dist[s] = 0
    bef = [0] * n
    bef[s] = s
    hq = [(0, s)] #距離、地点を記録したヒープを作る
    heapq.heapify(hq)
    visit = [False] * n #訪れたかの判定
    while(len(hq) > 0):
        c, v = heapq.heappop(hq) #ヒープから地点を1つ持ってくる
        visit[v] = True
        if c > dist[v]:
            continue
        for to, cost in graph[v]:
            if visit[to] == False and dist[v] + cost < dist[to]:
                dist[to] =  cost + dist[v]
                bef[to] = v
                heapq.heappush(hq, (dist[to], to))
    '''
    return bef
    '''
    return dist

n, m, k = map(int,input().split())
r = list(map(int,input().split()))

graph = [[] for _ in range(n)]
edge = [None] * k
dist = [[] for _ in range(n)]
for i in range(m):
    a, b, c = map(int,input().split())
    a -= 1
    b -= 1
    if b < a: a, b = b, a
    graph[a].append((b, c))
    graph[b].append((a, c))
    if i + 1 in r:
        edge[r.index(i + 1)] = (a, b, c)

dist[0] = dijkstra(0, n, graph)
dist[n - 1] = dijkstra(n - 1, n, graph)

for x, y, z in edge:
    dist[x] = dijkstra(x, n, graph)
    dist[y] = dijkstra(y, n, graph)

dp = [[[INF] * 2 for _ in range(k + 1)] for _ in range(2 ** k + 1)]
for i in range(k):
    for j in range(2):
        dp[2 ** i][i][j] = dist[0][edge[i][1 - j]] + edge[i][2] 

for bit in range(2 ** k):
    for now in range(k):
        if not (1 & (bit >> now)):
            continue
        for to in range(k):
            if (1 & (bit >> to)):
                continue
            for v in range(2):
                for u in range(2):
                    dp[bit + 2 ** to][to][v] = min(dp[bit + 2 ** to][to][v], dp[bit][now][u] + dist[edge[now][u]][edge[to][1 - v]] + edge[to][2])


ans = INF

for i in range(k):
    for v in range(2):
        ans = min(ans, dp[2 ** k - 1][i][v] + dist[n - 1][edge[i][v]])
print(ans)