#include<iostream>
#include<fstream>
#include<vector>
#include<queue>
#include<bitset>
using namespace std;
#define bit( x , nr ) ( ( (x) & (1<<( (nr)-1) ) )!=0 )
const int NMAX = 2001;
const int KMAX = 16;
const int INF = (1<<30);
struct NOD {
	int y,cost;
	inline NOD(int _y, int _cost) {
		y=_y;
		cost=_cost;
	}
	inline bool operator < (const NOD &c) const {
		return cost>c.cost;
	}
};
priority_queue <NOD> c;
vector <NOD> v[NMAX];
bitset <NMAX> p;
int d[KMAX][NMAX],dp[KMAX][(1<<KMAX)+1],l[KMAX+1],k,costmin,n;
void dijkstra(int nod, int d[], int n)
{
	int x,i;
	c.push(NOD(nod,0));
	for(i=1;i<=n;i++) {
		p[i]=0;
		d[i]=INF;
	}
	d[nod]=0;
	while(c.empty()==0) {
		x=c.top().y;
		c.pop();
		if(p[x]==0) {
			p[x]=1;
			for(vector <NOD> :: iterator it=v[x].begin();it!=v[x].end();it++) 
				if(d[it->y]>d[x]+it->cost) {
					d[it->y]=d[x]+it->cost;
					c.push(NOD(it->y,d[it->y]));
				}
		}
	}
}
int calc(int i, int s)
{
	int j;
	if((1<<(i-1))==s)
		dp[i][s]=d[0][l[i]];
	else if(dp[i][s]==INF) {
		for(j=1;j<=k;j++)
			if(i!=j && bit(s,j) )
				dp[i][s]=min(dp[i][s],calc(j,s-(1<<(i-1)))+d[i][l[j]]);
	}
	return dp[i][s];
}
int main ()
{
	int m,i,j,x,y,cost;
	ifstream f("ubuntzei.in");
	ofstream g("ubuntzei.out");
	f>>n>>m>>k;
	for(i=1;i<=k;i++)
		f>>l[i];
	l[0]=1;
	l[k+1]=n;
	for(i=1;i<=m;i++) {
		f>>x>>y>>cost;
		v[x].push_back(NOD(y,cost));
		v[y].push_back(NOD(x,cost));
	}
	f.close();
	for(i=0;i<=k;i++) 
		dijkstra(l[i],d[i],n);
	costmin=INF;
	if(k==0) {
		g<<d[0][n]<<'\n';
		g.close();
		return 0;
	}
	for(i=0;i<=k;i++)
		for(j=0;j<=(1<<k);j++)
			dp[i][j]=INF;
	for(i=1;i<=k;i++) 
		costmin=min(costmin,calc(i,(1<<k)-1)+d[i][n]);
	g<<costmin<<'\n';
	g.close();
	return 0;
}