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<<30)-100;
const long long INFL=(1LL<<62);
const double eps=1e-10;
const long double pi=acos(-1.0);
const int MAXN=2010;

vector<pair<int,int > > v[MAXN];
int frend[MAXN];
int dp[MAXN][1<<15];

struct node{
    node(int a,int b,int c):nd(a),cost(b),bin(c){}
    int nd,cost,bin;
};

struct cmp{
    bool operator()(const node& n1,const node &n2){
        return n1.cost<n2.cost;
    }
};

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

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

    for(int i=1;i<=k;i++){
        int idx;
        scanf("%d",&idx);
        frend[idx]=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=1;i<=n;i++){
        for(int j=1;j<(1<<15);j++){
            dp[i][j]=INFI;
        }
    }

    dp[1][0]=0;
    priority_queue<node,vector<node>,cmp> pq;
    pq.push(node(1,0,0));

    while(!pq.empty()){
        int i=pq.top().nd;
        int con=pq.top().bin;
        pq.pop();

        for(unsigned j=0;j<v[i].size();j++){
            int u=v[i][j].first;
            int lng=v[i][j].second;
            int nxt;

            if(frend[u]){
                nxt=1<<(frend[u]-1);
            }else{
                nxt=0;
            }

            if(dp[i][con]+lng < dp[u][con|nxt]){
                dp[u][con|nxt]=dp[i][con]+lng;
                pq.push(node(u,dp[u][con|nxt],con|nxt));
            }
        }
    }

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

    return 0;
}