#include <fstream>
#include <vector>
#include <queue>

using namespace std;

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

const int NMAX = 2e3;
const int inf = 1e9;

int lmin[NMAX + 1][NMAX + 1], dp[NMAX + 1], masca;
priority_queue <pair <int, int>> q;
vector <pair <int, int>> g[NMAX + 1];
vector <int> orase;

void dijkstra(int nod){

    /*

        lmin[i][j] = costul minim cu care ajung in orasul j, pornind din orasul i

    */

    q.push({0, nod});
    lmin[nod][nod] = 0;

    while(!q.empty()){

        pair <int, int> x = q.top();
        q.pop();

        for(auto y : g[x.second]){
            if(lmin[nod][y.first] > lmin[nod][x.second] + y.second){

                lmin[nod][y.first] = lmin[nod][x.second] + y.second;
                q.push({lmin[nod][y.first], y.first});

            }
        }

    }

}

bool putere2(int x){

    int biti = 0;

    while(x){

        if((x & 1))
            biti++;

        x >>= 1;

    }

    return (biti == 1);

}

int main(){

    int n = 0, m = 0;
    cin >> n >> m;

    for(int i = 1; i <= n; i++){
        for(int j = 1; j <= n; j++){

            lmin[i][j] = inf;

        }
    }


    int k = 0;
    cin >> k;

    orase.push_back(1);
    for(int i = 0; i < k; i++){

        int x = 0;
        cin >> x;

        orase.push_back(x);

    }

    orase.push_back(n);


    for(int i = 0; i < m; i++){

        int x = 0, y = 0, cost = 0;
        cin >> x >> y >> cost;

        g[x].push_back({y, cost});
        g[y].push_back({x, cost});

    }


    for(auto e : orase){

        dijkstra(e);

    }

    masca = (1 << (k + 2)) - 1;

    for(int i = 1; i <= masca; i++){

        if(putere2(i)){

            dp[i] = 0;
            continue;

        }

        dp[i] = inf;

        for(int j = 0; (1 << j) <= i; j++){

            if((i & (1 << j)) == 0)
                continue;

            // am orasul j in traseu
            int new_mask = (i ^ (1 << j));

            for(int p = 0; (1 << p) <= new_mask; p++){
                if((new_mask & (1 << p))){

                    dp[i] = min(dp[i], dp[new_mask] + lmin[orase[p]][orase[j]]);
                    dp[i] = min(dp[i], dp[new_mask] + lmin[orase[j]][orase[p]]);

                }
            }

        }

    }

    cout << dp[masca];


    return 0;
}