#include <stdio.h>
#include <queue>
#include <vector>
#define mp make_pair
#define f first
#define s second
using namespace std;
int t,i,x,y,z,n,m,k;
int j;
int din[1<<16][20],d[2005][2005];
int viz[2005];
priority_queue < pair <int,int >, vector <pair <int,int > >, greater <pair <int,int > > > h;
vector < pair <int,int> > v[2005];
void dijkstra(int i){
int j;
for(j=1;j<=n;j++) viz[j]=0,d[i][j]=1e9;
d[i][i]=0;
h.push(mp(0,i));
while(!h.empty()){
int nod=h.top().s;
h.pop();
if(!viz[nod]){
     for(j=0;j<v[nod].size();j++){
        if(d[i][v[nod][j].s]>v[nod][j].f+d[i][nod])
        {
           d[i][v[nod][j].s]=v[nod][j].f+d[i][nod];
           h.push(mp(d[i][v[nod][j].s],v[nod][j].s));


        }


    viz[nod]=1;
}



}


}
}

int prieteni[25];
int main()
{
    freopen("ubuntzei.in","r",stdin);
    freopen("ubuntzei.out","w",stdout);
    scanf("%d%d%d",&n,&m,&k);
    for(i=1;i<=k;i++)scanf("%d",&prieteni[i]);
    for(i=1;i<=m;i++){
        scanf("%d%d%d",&x,&y,&z);
    v[x].push_back(mp(z,y));
    v[y].push_back(mp(z,x));

    }
    dijkstra(1);
    for(i=1;i<=k;   i++) dijkstra(prieteni[i]);
    if(k==0){
        printf("%d\n",d[1][n]);
        return 0;

    }
    for(i=1;i<(1<<k);i++)
        for(j=1;j<=n;j++) din[i][j]=1e9;
    for(i=1;i<=k;i++) din[(1<<(i-1))][i]=d[1][prieteni[i]];
    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(t!=j&&(i&(1<<(t-1))))
                din[i][j]=min(din[i][j],din[i^(1<<(j-1))][t]+d[prieteni[t]][prieteni[j]]);
int mmax=1e9;
for(i=1;i<=k;i++)
    mmax=min(mmax,din[(1<<k)-1][i]+d[prieteni[i]][n]);

    printf("%d\n",mmax);

    return 0;
}