#include <bits/stdc++.h>
using namespace std;
ifstream f ("ubuntzei.in");
ofstream g ("ubuntzei.out");
const int nMax = 2003;
const int dMax = 20;
const int kMax = 32770;
const int INF = 1E9;
struct Grf{
    int nod, cost;

};
struct cmp{
    inline bool operator ()(const Grf A,const Grf B)
    {
        return A.cost>B.cost;
    }
};
int a[dMax], dist[nMax], dp[nMax][kMax],cost[dMax][dMax], costn[nMax];
int n, m, x, y, z, k;
vector <Grf> Graf[nMax];
priority_queue < Grf,vector <Grf> , cmp > Q;
inline void Read() {
    f >> n >> m;
    f >> k;
    for(int i = 0; i < k ;i++) {
        f>> a[i];
    }
    for(int i = 1; i <= m; i++) {
        f >> x >> y >> z;
        Grf vals;
        vals.nod = y;
        vals.cost = z;
        Graf[x].push_back(vals);
        vals.nod = x;
        Graf[y].push_back(vals);
    }
}
inline void Dij(int nod) {
    Grf vals, p;
    vals.nod = nod;
    vals.cost = 0;
    Q.push(vals);
    while(!Q.empty()) {
        p = Q.top();
        Q.pop();
        int node = p.nod;
        for(auto i:  Graf[node]) {
            int nNode = i.nod;
            int nCost = i.cost;
            if(dist[nNode] > dist[node] + nCost) {
                dist[nNode] = dist[node] + nCost;
                Grf news;
                news.nod = nNode;
                news.cost = dist[nNode];
                Q.push(news);
            }
        }
    }
}
inline void Solve() {
    int kbMax = ((1 << k)) - 1;
    for(int i = 0; i < k;i++) {
        for(int stare = 0; stare <= kbMax; stare++) {
            dp[i][stare] = INF;
        }
    }

    for(int i = 1; i <= n; i++) {
        dist[i] = INF;
    }
    dist[1] = 0;
    Dij(1);
    for(int i = 0; i < k; i++) {
        dp[i][(1 << i)] = dist[a[i]];
    }
    int ans = dist[n];
    for(int i = 0; i < k; i++) {
        for(int j = 0 ;j <= n; j++) {
            dist[j] = INF;
        }
        dist[a[i]] = 0;
        Dij(a[i]);
        for(int j = 0; j < k; j++) {
            cost[i][j] = dist[a[j]];
        }
        costn[i] = dist[n];
    }
    for(int stare = 0; stare <= kbMax; stare++) {
        for(int i = 0; i < k; i++) {
            if(stare & (1 << i)) {
                for(int j = 0; j < k ; j++) {
                    if(stare & (1 << j) && (i != j)) {
                        dp[i][stare] = min(dp[i][stare], dp[j][stare - (1 << i)] + cost[i][j]);
                    }
                }
            }
        }
    }
    if(k == 0) {
        g <<  ans << "\n";
        return;
    }
    ans = INF;
    for(int i = 0; i < k; i++){
        ans = min(ans, dp[i][kbMax] + costn[i]);
    }
    g<< ans << "\n";


}
int main()
{
    Read();
    Solve();
    return 0;
}