#include <stdio.h>
#include <vector>
#include <queue>
#define NMAX 2005
#define LMAX 16
#define HMAX (1<<16)
#define INF 1000000005
#define pii pair <int,int>
#define pb push_back
#define mp make_pair
#define f first
#define s second
using namespace std;
int n,m,k,A[LMAX],D[LMAX][NMAX],best[HMAX][LMAX],rez;
queue <int> Q;
vector <pii> B[NMAX];
bool in[NMAX];
void read()
{
	scanf("%d%d%d",&n,&m,&k);
	int i,a,b,c;
	for (i=1; i<=k; i++)
		scanf("%d",&A[i]);
	for (i=1; i<=m; i++)
	{
		scanf("%d%d%d",&a,&b,&c);
		B[a].pb(mp(b,c));
		B[b].pb(mp(a,c));
	}
}
void bford(int act,int ind)
{
	int i,nod,vec,cost;
	for (i=1; i<=n; i++)
		D[ind][i]=INF;
	D[ind][act]=0;
	Q.push(act); in[act]=1;
	while (!Q.empty())
	{
		nod=Q.front();
		Q.pop();
		in[nod]=0;
		for (i=0; i<B[nod].size(); i++)
		{
			vec=B[nod][i].f; cost=B[nod][i].s;
			if (D[ind][vec]>D[ind][nod]+cost)
			{
				D[ind][vec]=D[ind][nod]+cost;
				if (!in[vec])
					Q.push(vec),in[vec]=1;
			}
		}
	}
}
void precompute()
{
	int i;
	for (i=1; i<=k; i++)
		bford(A[i],i);
}
inline int min(int x,int y)
{
	return x<y ? x : y;
}
void solve()
{
	int i,j,t,stare;
	for (i=0; i<(1<<k); i++)
		for (j=1; j<=k; j++)
			best[i][j]=INF;
	for (i=1; i<=k; i++)
		best[1<<(i-1)][i]=D[i][1];
	for (i=1; i<(1<<k); i++)
		for (j=1; j<=k; j++)
			if (i & (1<<(j-1)))
				for (t=1; t<=k; t++)
					if (!(i & (1<<(t-1))))
					{
						stare=i ^ (1<<(t-1));
						best[stare][t]=min(best[stare][t],best[i][j]+D[j][A[t]]);
					}
	rez=INF;
	for (i=1; i<=k; i++)
		rez=min(rez,best[(1<<k)-1][i]+D[i][n]);
}
int main()
{
	freopen("ubuntzei.in","r",stdin);
	freopen("ubuntzei.out","w",stdout);
	read();
	precompute();
	solve();
	printf("%d\n",rez);
	return 0;
}