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

import itertools
import heapq
INF = float("inf")

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 = [[0]*N for _ in [0]*N]


for rbit in range(1 << K):
	b = [(rbit >> i) & 1 for i in range(K)]

	dp = [[INF]*K for i in range(1 << K)]
	for i in range(K):
		p = edge[lR[i]][b[i]]
		if(dist[0][p] == 0):
			dist[0][p] = dist[p][0] = dijkstra(route,0,p,N)
		dp[1 << i][i] = dist[0][p] + rsum
	
	for bit in range(1, 1 << K):
		for s in range(K):
			p = edge[lR[s]][b[s]^1]
			if not(bit & (1 << s)):
				continue
			for t in range(K):
				np = edge[lR[t]][b[t]]
				k = bit | (1 << t)
				if(dist[p][np] == 0):
					dist[p][np] = dist[np][p] = dijkstra(route,p,np,N)
				d = dp[bit][s] + dist[p][np]
				if((bit & (1 << t)) == 0 and dp[k][t] > d):
					dp[k][t] = d

	c = INF
	for i in range(K):
		p = edge[lR[i]][b[i]^1]
		if(dist[p][N-1] == 0):
			dist[p][N-1] = dist[N-1][p] = dijkstra(route,p,N-1,N)
		d = dp[-1][i] + dist[p][N-1]
		if(c > d):
			c = d

	if(ans > c):
		ans = c

print(ans)