n,m,k=map(int,input().split())
r=list(map(int,input().split()))
for i in range(k):
  r[i]-=1
e=[[[] for j in range(n)] for i in range(1<<k)]
for i in range(m):
  a,b,c=map(int,input().split())
  a-=1
  b-=1
  for j in range(1<<k):
    if i not in r:
      e[j][a]+=[(j,b,c)]
      e[j][b]+=[(j,a,c)]
    else:
      p=r.index(i)
      if (j>>p)&1==0:
        e[j][a]+=[(j|(1<<p),b,c)]
        e[j][b]+=[(j|(1<<p),a,c)]
      else:
        e[j][a]+=[(j,b,c)]
        e[j][b]+=[(j,a,c)]
from heapq import heappush,heappop
X=10**10
v=[[X]*n for i in range(1<<k)]
v[0][0]=0
q=[(0,0,0)]
while len(q)>0:
  sc,sp,sy=heappop(q)
  if sc>v[sp][sy]:
    continue
  for tp,ty,tc in e[sp][sy]:
    if v[tp][ty]>sc+tc:
      v[tp][ty]=sc+tc
      heappush(q,(v[tp][ty],tp,ty))
print(v[-1][-1])