// May this submission get accepted!

#pragma GCC optimize ("O3")
#pragma GCC target ("tune=native")
#pragma GCC target ("avx")

#include <bits/stdc++.h>

// 汎用マクロ
#define ALL_OF(x) (x).begin(), (x).end()
#define REP(i,n) for (long long i=0, i##_len=(n); i<i##_len; i++)
#define RANGE(i,is,ie) for (long long i=(is), i##_end=(ie); i<=i##_end; i++)
#define DSRNG(i,is,ie) for (long long i=(is), i##_end=(ie); i>=i##_end; i--)
#define STEP(i, is, ie, step) for (long long i=(is), i##_end=(ie), i##_step = (step); i<=i##_end; i+=i##_step)
#define UNIQUE(v) do { sort((v).begin(), (v).end()); (v).erase(unique((v).begin(), (v).end()), (v).end()); } while (false)
template<class T> bool chmax(T &a, const T &b) {if (a < b) {a = b; return true;} return false; }
template<class T> bool chmin(T &a, const T &b) {if (a > b) {a = b; return true;} return false; }
#define INF 0x7FFFFFFF
#define LINF 0x7FFFFFFFFFFFFFFFLL
#define Yes(q) ((q) ? "Yes" : "No")
#define YES(q) ((q) ? "YES" : "NO")
#define Possible(q) ((q) ? "Possible" : "Impossible")
#define POSSIBLE(q) ((q) ? "POSSIBLE" : "IMPOSSIBLE")
#define DUMP(q) cerr << "[DEBUG] " #q ": " << (q) << " at " __FILE__ ":" << __LINE__ << endl
#define DUMPALL(q) do { cerr << "[DEBUG] " #q ": ["; REP(i, (q).size()) { cerr << (q)[i] << (i == i_len-1 ? "" : ", "); } cerr << "] at " __FILE__ ":" << __LINE__ << endl; } while (false)
template<class T> T gcd(const T &a, const T &b) { return a < b ? gcd(b, a) : b ? gcd(b, a % b) : a; }
template<class T> T lcm(const T &a, const T &b) { return a / gcd(a, b) * b; }

// gcc拡張マクロ
#define popcount __builtin_popcount
#define popcountll __builtin_popcountll

// エイリアス
#define DANCE_ long
#define ROBOT_ unsigned
#define HUMAN_ signed
#define CHOKUDAI_ const
using  ll = DANCE_ HUMAN_ DANCE_;
using ull = DANCE_ ROBOT_ DANCE_;
using cll = DANCE_ DANCE_ CHOKUDAI_;
using  ld = long double;
using namespace std;

// モジュール


// 処理内容
int main() {
    
    ios::sync_with_stdio(false);
    cin.tie(0);

    ll n, m, rn; cin >> n >> m >> rn;
    vector<ll> r(rn);
    REP(i, rn) {
        cin >> r[i];
        --r[i]; // 0-indexed
    }
    vector<ll> a(m), b(m), c(m);
    using pll = pair<ll, ll>;
    vector<vector<pll>> g(n);
    REP(i, m) {
        cin >> a[i] >> b[i] >> c[i];
        --a[i]; --b[i]; // 0-indexed
        g[a[i]].emplace_back(b[i], c[i]);
        g[b[i]].emplace_back(a[i], c[i]);
    }

    map<ll, vector<ll>> d;
    REP(i, rn) {
        ll src = r[i];
        vector<ll> dp(n, INF);
        priority_queue<pll, vector<pll>, greater<pll>> q;
        q.push(pll(0, src));
        dp[src] = 0;
        while (q.size()) {
            ll d = q.top().first;
            ll u = q.top().second;
            q.pop();
            if (dp[u] < d) continue;
            for (pll &p : g[u]) {
                ll v = p.first;
                ll e = p.second;
                if (chmin(dp[v], d + e)) {
                    q.push(pll(d + e, v));
                }
            }
        }
        d[src] = dp;
    }

    ll ans = INF;
    vector<ll> rank(rn);
    iota(ALL_OF(rank), 0LL);
    do {
        ll term = 0;
        REP(i, rn-1) {
            ll src = r[rank[i]];
            ll dst = r[rank[i+1]];
            term += d[src][dst];
        }
        chmin(ans, term);
    } while (next_permutation(ALL_OF(rank)));

    cout << ans << endl;
    
}

Measured memory_bytes: 1664