import sys
readline=sys.stdin.readline
import heapq

N,M,K=map(int,readline().split())
R=list(map(int,readline().split()))
graph=[[] for x in range(N)]
idx=[-1]*M
for k in range(K):
    R[k]-=1
    idx[R[k]]=k
for m in range(M):
    A,B,C=map(int,readline().split())
    A-=1;B-=1
    graph[A].append((B,C,idx[m]))
    graph[B].append((A,C,idx[m]))
inf=1<<30
dist=[[inf]*N for bit in range(1<<K)]
dist[0][0]=0
queue=[]
queue=[(0,0,0)]
while queue:
    dx,bitx,x=heapq.heappop(queue)
    if dist[bitx][x]<dx:
        continue
    for y,dy,i in graph[x]:
        bity=bitx
        if i!=-1:
            bity|=1<<i
        if dist[bity][y]>dx+dy:
            dist[bity][y]=dx+dy
            heapq.heappush(queue,(dist[bity][y],bity,y))
ans=dist[(1<<K)-1][N-1]
print(ans)