using namespace std;
#include <set>
#include <map>
#include <list>
#include <deque>
#include <stack>
#include <queue>
#include <cmath>
#include <ctime>
#include <cctype>
#include <cstdio>
#include <vector>
#include <string>
#include <bitset>
#include <utility>
#include <iomanip>
#include <fstream>
#include <cstring>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <functional>
#define oo (1<<30)
#define f first
#define s second
#define II inline
#define db double
#define ll long long
#define pb push_back
#define mp make_pair
#define Size(V) ((int)(V.size()))
#define all(V) (V).begin() , (V).end()
#define CC(V) memset((V),0,sizeof((V)))
#define CP(A,B) memcpy((A),(B),sizeof((B)))
#define FOR(i,a,b) for(int (i)=(a);(i)<=(b);++(i))
#define REP(i, N) for (int (i)=0;(i)<(int)(N);++(i))
#define FORit(it, x) for (__typeof((x).begin()) it = (x).begin(); it != (x).end(); ++it)
#define IN "ubuntzei.in"
#define OUT "ubuntzei.out"
#define K_MAX (1<<5)
#define bit(x) (1<<((x)-1))
#define N_MAX (1<<11)
typedef vector<int> VI;
typedef pair<int,int> pi;
typedef vector<string> VS;
template<class T> string toString(T n) {ostringstream ost;ost<<n;ost.flush();return ost.str();}
int N,M,K;
int Knod[K_MAX],Cost[K_MAX][K_MAX],C[K_MAX][1<<15];
vector< vector<pi> > A(N_MAX);
II void scan()
{
freopen(IN,"r",stdin);
freopen(OUT,"w",stdout);
scanf("%d%d%d",&N,&M,&K);
FOR(i,1,K)
scanf("%d",&Knod[i]);
int x,y,c;
FOR(i,1,M)
{
scanf("%d%d%d",&x,&y,&c);
A[x].pb( mp(y,c) );
A[y].pb( mp(x,c) );
}
}
int Dist[N_MAX];
struct comp{ bool operator() (int i,int j) {return Dist[i] > Dist[j];} };
priority_queue<int,VI,comp> Q;
II void Dijkastra(int S,int Cost[])
{
memset(Dist,100,sizeof(Dist));
bitset<N_MAX> viz;
viz[S] = true;
Dist[S] = 0;
Q.push(S);
for(int nod;!Q.empty();)
{
nod = Q.top();
viz[nod] = false;
Q.pop();
FORit(it,A[nod])
if(Dist[it->f] > Dist[nod] + it->s)
{
Dist[it->f] = Dist[nod] + it->s;
if(!viz[it->f])
{
viz[it->f] = true;
Q.push(it->f);
}
}
}
Cost[0] = Dist[1];
Cost[K + 1] = Dist[N];
FOR(i,1,K)
Cost[i] = Dist[ Knod[i] ];
}
II void solve()
{
Dijkastra(1,Cost[0]);
//printf("%d\n",Cost[0][K + 1]);
//FOR(i,1,K)
// printf("%d\n",Cost[0][i]);
Dijkastra(N,Cost[N]);
FOR(i,1,K)
Dijkastra(Knod[i],Cost[i]);
memset(C,100,sizeof(C));
if(!K)
{
printf("%d\n",Cost[0][K + 1]);
return;
}
FOR(i,1,K)
C[i][ bit(i) ] = Cost[0][i];
FOR(cfg,1,(1<<K) - 1)
FOR(nod,1,K)
{
if(!(cfg & bit(nod)))
continue;
FOR(last,1,K)
{
if(!(cfg & bit(last)))
continue;
C[nod][cfg] = min(C[nod][cfg],C[last][cfg ^ bit(nod)] + Cost[last][nod]);
}
}
int rez = oo;
FOR(i,0,K)
rez = min(rez,C[i][(1<<K)-1] + Cost[i][K + 1]);
printf("%d\n",rez);
}
int main()
{
scan();
solve();
return 0;
}