using namespace std;

#include<iomanip>
#include<cmath>
#include<algorithm>
#include<vector>
#include<set>
#include<string>
#include<map>
#include<queue>
#include<stack>
#include<utility>
#include<cstdio>
#include<cstdlib>
#include<cassert>
#include<numeric>
#include<cstring>
#include<sstream>
#include<algorithm>
#include<deque>

const int INFI=(1LL<<29)-100;
const long long INFL=(1LL<<62);
const double eps=1e-10;
const long double pi=acos(-1.0);
const int MAXN=2010;
const int MAXK=17;

int n;
vector<pair<int,int > > v[MAXN];
int fr[MAXK];
int dst[MAXN][MAXK];
int dp[1<<MAXK][MAXK];

void dijkstra(int k){
    for(int i=1;i<=n;i++){
        dst[i][k]=INFI;
    }
    dst[fr[k]][k]=0;

    priority_queue<pair<int,int> ,vector<pair<int,int> >, greater<pair<int,int> > > pq;
    pq.push(make_pair(0,fr[k]));

    while(!pq.empty()){
        int i=pq.top().second;
        pq.pop();

        for(unsigned j=0;j<v[i].size();j++){
            int u=v[i][j].first;
            int cs=v[i][j].second;
            if(dst[u][k] > dst[i][k]+cs){
                dst[u][k]=dst[i][k]+cs;
                pq.push(make_pair(dst[u][k],u));
            }
        }
    }

    return;
}

int main(){
    freopen("ubuntzei.in","r",stdin);
    freopen("ubuntzei.out","w",stdout);
    int m,k;

    scanf("%d%d%d",&n,&m,&k);

    fr[0]=1;
    for(int i=1;i<=k;i++){
        scanf("%d",&fr[i]);
    }

    for(int i=1;i<=m;i++){
        int x,y,cs;
        scanf("%d%d%d",&x,&y,&cs);
        v[x].push_back(make_pair(y,cs));
        v[y].push_back(make_pair(x,cs));
    }

    for(int i=0;i<=k;i++){
        dijkstra(i);
    }

    k++;
    fr[k]=n;
    for(int i=0;i<=(1<<k);i++){
        for(int j=0;j<=k;j++){
            dp[i][j]=INFI;
        }
    }
    dp[0][0]=0;

    for(int i=1;i<1<<k;i++){
        for(int j=1;j<=k;j++){
            int nd=1<<(j-1);

            if( nd & i ){
                for(int t=0;t<=k;t++){
                    dp[i][j]=min(dp[i][j],dp[i^nd][t]+dst[fr[j]][t]);
                }
            }

        }
    }

    printf("%d",dp[(1<<k)-1][k]);

    return 0;
}