#include <bits/stdc++.h>
#define pb push_back

using namespace std;

ifstream fin("ubuntzei.in");
ofstream fout("ubuntzei.out");

void debug_out() { cerr << '\n'; }
template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) { cerr << " " << H; debug_out(T...);}
#define dbg(...) cerr << #__VA_ARGS__ << " ->", debug_out(__VA_ARGS__)
#define dbg_v(x, n) do{cerr<<#x"[]: ";for(int _=0;_<n;++_)cerr<<x[_]<<" ";cerr<<'\n';}while(0)
#define dbg_ok cerr<<"OK!\n"

typedef pair<int,int> pii;
typedef long long int ll;
typedef long double ld;

const int DMAX = 2010;

struct nume{
    int node,val;
};

vector <nume> arb[DMAX];
priority_queue <nume> heap;

int vec[DMAX];
int dist[20][DMAX];
int dp[33000][20];
bool uz[DMAX];

int n,m,k;
int ans;

inline bool operator<(nume x,nume y){
    return x.val>y.val;
}

void dijk(int node,int dp[]);

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    int t,i,j;
    int x,y,z;
    int mask,mask2,pos;

    fin>>n>>m;
    fin>>k;
    for(i=0;i<k;i++)
        fin>>vec[i];
    for(i=1;i<=m;i++){
        fin>>x>>y>>z;
        arb[x].pb({y,z});
        arb[y].pb({x,z});
    }
    for(i=0;i<k;i++)
        dijk(vec[i],dist[i]);
    dijk(1,dist[k]);
    for(mask=1;mask<(1<<k);mask++)
        for(pos=0;pos<k;pos++)
            if(mask&(1<<pos)){
                mask2=mask^(1<<pos);
                if(mask2 == 0){
                    dp[mask][pos]=dist[k][vec[pos]];
                    break;
                }
                dp[mask][pos]=1e9;
                for(i=0;i<k;i++)
                    if(mask2&(1<<i))
                        dp[mask][pos]=min(dp[mask][pos],dp[mask2][i]+dist[i][vec[pos]]);
            }
    mask=(1<<k)-1;
    ans=1e9;
    for(i=0;i<k;i++)
        ans=min(ans,dp[mask][i]+dist[i][n]);
    fout<<ans<<'\n';
    return 0;
}
void dijk(int node,int dp[]){
    int i;
    for(i=1;i<=n;i++)
        dp[i]=1e9;
    dp[node]=0;
    heap.push({node,0});
    while(!heap.empty()){
            node=heap.top().node;
            heap.pop();
            uz[node]=false;
            for(auto& it:arb[node])
                if(dp[node]+it.val < dp[it.node]){
                    dp[it.node]=dp[node]+it.val;
                    if(!uz[it.node]){
                        uz[it.node]=true;
                        heap.push({it.node,dp[it.node]});
                    }
                }
    }
}