#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using ld = long double;

// g <- pair < v , cost > 
template < class T >
vector< T > dijkstra(vector<vector<pair<int, T>>> &graph, int s) {
    T INF = numeric_limits< T >::max();
    vector<T> dist(graph.size(), INF);
    priority_queue<pair<T,int>, vector<pair<T,int>>, greater<pair<T,int>>> q;
    q.push({dist[s] = T(0), s});
    while(!q.empty()){
        auto [uc, ui] = q.top(); q.pop();
        if(uc != dist[ui]) continue;
        for(auto [vi, vc] : graph[ui]) if(dist[vi] > uc + vc) 
            q.push({dist[vi] = uc + vc, vi});
    }
    return dist;
}

int main(){
    cin.tie(0);
    ios::sync_with_stdio(0);
    
    int N,M,K; cin >> N >> M >> K;
    vector<int> R(K);
    rep(i,K) cin >> R[i], R[i]--;
    vector<vector<pair<int,ll>>> G(N);
    vector<pair<pair<int,int>,ll>> E(M);
    for(auto &[e, c] : E) {
        auto &[u, v] = e;
        cin >> u >> v >> c; u--; v--;
        G[u].push_back({v, c});
        G[v].push_back({u, c});
    }

    vector<vector<pair<ll,ll>>> dp(1 << K, vector<pair<ll,ll>>(K, {1e18, 1e18}));
    vector<pair<vector<ll>,vector<ll>>> dist(K);
    auto chmin = [&](ll &a, ll b){ if(a > b) a = b; };
    rep(i,K) {
        dist[i].first  = dijkstra(G, E[R[i]].first.first );
        dist[i].second = dijkstra(G, E[R[i]].first.second);
    }
    vector<ll> dist0 = dijkstra(G, 0);
    rep(i,K) {
        chmin(dp[(1 << i)][i].first , dist0[E[R[i]].first.second] + E[R[i]].second);
        chmin(dp[(1 << i)][i].second, dist0[E[R[i]].first.first ] + E[R[i]].second);
    }

    rep(S,1<<K) {
        rep(u,K) if(S & (1 << u)) {
            rep(v,K) if(!(S & (1 << v))) {
                chmin(dp[S | (1 << v)][v].first , dp[S][u].first  + dist[u].first [E[R[v]].first.second] + E[R[v]].second);
                chmin(dp[S | (1 << v)][v].first , dp[S][u].second + dist[u].second[E[R[v]].first.second] + E[R[v]].second);
                chmin(dp[S | (1 << v)][v].second, dp[S][u].first  + dist[u].first [E[R[v]].first.first ] + E[R[v]].second);
                chmin(dp[S | (1 << v)][v].second, dp[S][u].second + dist[u].second[E[R[v]].first.first ] + E[R[v]].second);
            }
        }
    }
    ll ans = 1e18;
    rep(i,K) {
        chmin(ans, dp[(1 << K) - 1][i].first  + dist[i].first [N - 1]);
        chmin(ans, dp[(1 << K) - 1][i].second + dist[i].second[N - 1]);
    }
    cout << ans << "\n";
}