#include <bits/stdc++.h>
#define inf 2e9

using namespace std;

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

int n, m, k;
int d[18][2005], dp[18][40000], v[18];

bool viz[2002];

vector < pair <int, int> > g[2005];

struct cmp {
    bool operator() (pair <int, int> &x, pair <int, int> &y) const {
        return x.second>y.second;
    }
};

priority_queue < pair <int, int> , vector < pair <int, int> > , cmp> q;

void dijkstra(int s)
{
    int nod=v[s];
    for(int i=1;i<=n;i++)
    {
        viz[i]=0;
        d[s][i]=inf;
    }
    d[s][nod]=0;
    q.push({nod,0});
    while (!q.empty()) {
        pair <int,int> p = q.top();
        if (viz[p.first]==1)
        {
            q.pop();
            continue;
        }
        int curr = p.first;
        viz[curr]=1;
        for (int i=0;i<g[curr].size();i++) {
            int nou = g[curr][i].first;
            int cost = g[curr][i].second;
            if (viz[nou]==0 && d[s][nou] > d[s][curr] + cost) {
                d[s][nou] = d[s][curr] + cost;
                q.push({nou, d[s][nou]});
            }
        }
    }
}

int main () {
    fin>>n>>m;
    fin>>k;
    for (int i = 1;i <= k;i++)
        fin>>v[i];
    for (int i=1;i<=m;i++) {
        int x, y, dist;
        fin>>x>>y>>dist;
        g[x].push_back({y, dist});
        g[y].push_back({x, dist});
    }
    v[++k]=1;
    for (int i = 1;i <= k;i++) {
        dijkstra(i);
    }
    if(k==1)
    {
        fout<<d[1][n];
        return 0;
    }
    else
        k--;
    for (int i = 1; i <= k;i++) {
        for (int j = 1;j < (1<<k); j++)
            dp[i][j]=inf;
        dp[i][1<<(i-1)]=d[i][1];
    }
    for (int st=1;st<(1<<k);st++) {
        for (int i=1;i<=k;i++) {
          if(dp[i][st]!=inf)
           for(int j=1;j<=k;j++)
            if (i!=j && ((st>>(j-1))&1)==0) {
                {
                    int stare=st|(1<<(j-1));
                    dp[j][stare]=min(dp[j][stare],dp[i][st]+d[i][v[j]]);
                }

            }
        }
    }
    int sol=inf;
    for(int i=1;i<=k;i++)
        sol=min(sol,dp[i][(1<<k)-1]+d[i][n]);
    fout<<sol;
    return 0;
}