#include <bits/stdc++.h>
#define P pair<int,int>

using namespace std;

const int INF = 1e9;
const int NMAX = 2003;

int n, m;
vector<int> city;
vector<vector<P> > g(NMAX);
int drum[NMAX];
int d[NMAX][NMAX];
int dp[1<<17][17];

priority_queue<P,vector<P>,greater<P> > q;

void dijkstra(int node) {
    for(int i = 1; i <= n; i++)
        drum[i] = INF;
    q.push({0,node});
    drum[node] = 0;
    while(!q.empty()) {
        P nod = q.top();
        q.pop();
        for(auto child : g[nod.second]) {
            if(drum[child.first] > drum[nod.second] + child.second) {
                drum[child.first] = drum[nod.second] + child.second;
                q.push({drum[child.first], child.first});
            }
        }
    }
}

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

int main() {
    in >> n >> m;
    int k; in >> k;
    city.push_back(1);
    for(int i = 0; i < k; i++)  {
        int x;
        in >> x;
        city.push_back(x);
    }
    city.push_back(n);
    for(int i = 0; i < m; i++) {
        int x, y, c;
        in >> x >> y >> c;
        g[x].push_back({y,c});
        g[y].push_back({x,c});
    }
    for(int i = 0; i < k+2; i++) {
        dijkstra(city[i]);
        for(int j = 0; j < k+2; j++)
            d[i][j] = d[j][i] = drum[city[j]];
        d[i][i] = INF;
    }
    for(int i = 0; i < (1<<(k+2)); i++)
        for(int j = 0; j < k+2; j++)
            dp[i][j] = INF;
    dp[0][0] = d[0][0] = 0;
    for(int i = 0 ; i < (1<<(k+2)); i++)
        for(int j = 0; j < k+2; j++)
            if(i & (1<<j))
                for(int l = 0; l < k+2; l++)
                    dp[i][j] = min(dp[i][j], dp[i^(1<<j)][l] + d[j][l]);
    out << dp[(1<<(k+2))-1][k+1] << '\n';

    return 0;
}