#include <bits/stdc++.h>
using namespace std;
using ll = long long;

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n, m, k, u, v, c, ans = 1 << 30;
    cin >> n >> m >> k;
    vector<int> r(k);
    vector<pair<int,int>> S(2 * k);
    vector<tuple<int,int,int>> edge(m);
    vector<vector<int>> A(n, vector<int>(n, 1 << 29));
    for(auto &&v : r) cin >> v, v--;
    for(int i = 0; i < m; i++){
        cin >> u >> v >> c;
        u--, v--;
        A[u][v] = A[v][u] = c;
        edge[i] = make_tuple(u, v, c);
    }
    for(int i = 0; i < n; i++) A[i][i] = 0;
    for(int k = 0; k < n; k++){
        for(int i = 0; i < n; i++){
            for(int j = 0; j < n; j++){
                A[i][j] = min(A[i][j], A[i][k] + A[k][j]);
            }
        }
    }
    for(int i = 0; i < k; i++){
        tie(u, v, c) = edge[r[i]];
        S[i + i] = make_pair(u, c);
        S[i + i + 1] = make_pair(v, c);
    }
    vector<vector<int>> dp(1 << 2 * k, vector<int>(2 * k, 1 << 29));
    for(int i = 0; i < S.size(); i++) dp[1 << i][i] = A[0][S[i].first];
    for(int i = 0; i < dp.size(); i++){
        for(int j = 0; j < dp[i].size(); j++){
            if(~i >> j & 1) continue;
            int pj = j ^ 1;
            if(~i >> pj & 1){
                dp[i | (1 << pj)][pj] = min(dp[i | (1 << pj)][pj], dp[i][j] + S[j].second);
                continue;
            }
            for(int k = 0; k < dp[i].size(); k++){
                dp[i | (1 << k)][k] = min(dp[i | (1 << k)][k], dp[i][j] + A[S[j].first][S[k].first]);
            }
        }
    }
    for(int i = 0; i < S.size(); i++) ans = min(ans, dp.back()[i] + A[S[i].first][n - 1]);
    cout << ans << '\n';
}