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)
	if not(1 <= A+1 <= N and 1 <= B+1 <= N and 1 <= C <= 10**4):
		print((i,A+1,B+1,C))
		exit(1)
	route[A].append((B,C))
	route[B].append((A,C))

def dijkstra(route):
	dist = {}
	for i in st:
		q = [(0,i)]
		st2 = set([])
		while(q and len(st2) < len(st)):
			d,v = heapq.heappop(q)
			if((i,v) not in dist):
				if(v in st):
					st2.add(v)
				dist[(i,v)] = d
				for nv,nd in route[v]:
					heapq.heappush(q,(d + nd,nv))
	return dist

ans = INF
rsum = sum(edge[i][2] for i in R)
dist = dijkstra(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[lR[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):
						d = dp[bit][s][i ^ 1] + dist[(edge[lR[s]][i],edge[lR[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[lR[i]][j],N - 1)]
		if(ans > d):
			ans = d
print(ans)