import heapq as hq
import sys
input = sys.stdin.readline
INF = 10 ** 18

N,M,K = map(int, input().split())
R = [i - 1 for i in map(int, input().split())]
S = set(R)
edge = [[] for _ in [0] * M]
route = [[] for _ in [0] * N]
rsum = 0
for i in range(M):
	a,b,c = map(int, input().split())
	a -= 1;	b -= 1
	route[a].append((b,c))
	route[b].append((a,c))
	if(i in S):
		edge[i] = [a,b,c]
		rsum += c

def dijkstra(s,route):
	que = [(0,s)]
	dist = [INF] * N
	while(que):
		d,v = hq.heappop(que)
		if(dist[v] < INF):
			continue
		dist[v] = d
		for nv,nd in route[v]:
			hq.heappush(que,(d + nd, nv))
	return dist

dist = [[] for _ in [0] * N]
T = set([0,N - 1])
for i in S:
	T.add(edge[i][0])
	T.add(edge[i][1])
for i in T:
	dist[i] = dijkstra(i,route)

dp = [[[INF] * 2 for _ in [0] * K] for _ in [0] * (1 << K)]
for i in range(K):
	for j in range(2):
		dp[1 << i][i][j] = rsum + dist[0][edge[R[i]][j]]
for bit in range(1, 1 << K):
	for s in range(K):
		if not(bit & (1 << s)):
			continue
		for i in range(2):
			for t in range(K):
				if not(bit & (1 << t)):
					b = bit | (1 << t)
					for j in range(2):
						p = edge[R[t]][j]
						d = dp[bit][s][i ^ 1] + dist[edge[R[s]][i]][edge[R[t]][j]]
						if(dp[b][t][j] > d):
							dp[b][t][j] = d
ans = INF
for i in range(K):
	for j in range(2):
		d = dp[-1][i][j ^ 1] + dist[edge[R[i]][j]][N - 1]
		if(ans > d):
			ans = d
print(ans)