#ダイクストラ高速化弱め

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

N,M,K = map(int,input().split())
R = set([i-1 for i in map(int,input().split())])
lR = list(R)

route = [[] for _ in [0]*N]
edge = [0]*M
st = set([0,N-1])
for i in range(M):
	A,B,C = map(int,input().split())
	A -= 1;	B -= 1
	if(i in R):
		edge[i] = [A,B,C]
		st.add(A);	st.add(B)
	route[A].append((B,C))
	route[B].append((A,C))

def dijkstra(route,start,finish,n):
	path = [-1]*n
	q = [(0,start)]
	while(q):
		d,v = heapq.heappop(q)
		if(path[v] == -1):
			path[v] = d
			if(v == finish):
				break
			for nv,dist in route[v]:
				heapq.heappush(q,(d+dist,nv))
	return path[finish]

ans = INF
rsum = sum(edge[i][2] for i in R)
dist = {}

dp = [[[INF] * 2 for _ in [0] * K] for _ in [0] * (1 << K)]
for i in range(K):
	for j in range(2):
		p = edge[lR[i]][j]
		if((0,p) not in dist):
			dist[(0,p)] = dist[(p,0)] = dijkstra(route,0,p,N)
		dp[1 << i][i][j] = rsum + dist[(0,p)]
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[lR[s]][i];	q = edge[lR[t]][j]
						if((p,q) not in dist):
							dist[(p,q)] = dist[(q,p)] = dijkstra(route,p,q,N)
						d = dp[bit][s][i ^ 1] + dist[(p,q)]
						if(dp[b][t][j] > d):
							dp[b][t][j] = d
ans = INF
for i in range(K):
	for j in range(2):
		p = edge[lR[i]][j];	q = N - 1
		if((p,q) not in dist):
			dist[(p,q)] = dist[(q,p)] = dijkstra(route,p,q,N)
		d = dp[-1][i][j ^ 1] + dist[(p,q)]
		if(ans > d):
			ans = d
print(ans)