#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
template<class T> using V = vector<T>;
using VI = V<int>;
using VL = V<ll>;
using VS = V<string>;
template<class T> using PQ = priority_queue<T, V<T>, greater<T>>;
using graph = V<VI>;
template<class T> using w_graph = V<V<pair<int, T>>>;
#define FOR(i,a,n) for(int i=(a);i<(n);++i)
#define eFOR(i,a,n) for(int i=(a);i<=(n);++i)
#define rFOR(i,a,n) for(int i=(n)-1;i>=(a);--i)
#define erFOR(i,a,n) for(int i=(n);i>=(a);--i)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define inside(h,w,y,x) (unsigned(y)<h&&unsigned(x)<w)
#ifdef _DEBUG
#define line cout << "-----------------------------\n"
#define stop system("pause")
#endif
constexpr ll INF = 1000000000;
constexpr ll LLINF = 1LL << 61;
constexpr ll mod = 1000000007;
constexpr ll MOD = 998244353;
constexpr ld eps = 1e-10;
constexpr int dy[]{ -1,0,1,0 }, dx[]{ 0,1,0,-1 };
template<class T> inline bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; }return false; }
template<class T> inline bool chmin(T& a, const T& b) { if (a > b) { a = b; return true; }return false; }
inline void init() { cin.tie(nullptr); cout.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); }
template<class T> inline istream& operator>>(istream& is, V<T>& v) { for (auto& a : v)is >> a; return is; }
template<class T, class U> inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; }
template<class T> inline V<T> vec(size_t a) { return V<T>(a); }
template<class T> inline V<T> defvec(T def, size_t a) { return V<T>(a, def); }
template<class T, class... Ts> inline auto vec(size_t a, Ts... ts) { return V<decltype(vec<T>(ts...))>(a, vec<T>(ts...)); }
template<class T, class... Ts> inline auto defvec(T def, size_t a, Ts... ts) { return V<decltype(defvec<T>(def, ts...))>(a, defvec<T>(def, ts...)); }
template<class T> inline void print(const T& a) { cout << a << "\n"; }
template<class T, class... Ts> inline void print(const T& a, const Ts&... ts) { cout << a << " "; print(ts...); }
template<class T> inline void print(const V<T>& v) { for (int i = 0; i < v.size(); ++i)cout << v[i] << (i == v.size() - 1 ? "\n" : " "); }
template<class T> inline void print(const V<V<T>>& v) { for (auto& a : v)print(a); }
template<class T> inline constexpr const T cumsum(const V<T>& a, int l, int r) { return 0 <= l && l <= r && r < a.size() ? a[r] - (l == 0 ? 0 : a[l - 1]) : 0; }//[l,r]
template<class T> inline constexpr const T min(const V<T>& v) { return *min_element(all(v)); }
template<class T> inline constexpr const T max(const V<T>& v) { return *max_element(all(v)); }

int main() {
    init();

    int n, m, k; cin >> n >> m >> k;
    VI r(k), q(m, -1);
    FOR(i, 0, k) {
        cin >> r[i];
        --r[i];
        q[r[i]] = i;
    }

    V<tuple<int, int, int>> edge(m);
    V<V<pair<int, int>>> g(n);
    FOR(i, 0, m) {
        auto& [a, b, c] = edge[i];
        cin >> a >> b >> c;
        --a, --b;
        if (q[i] == -1) {
            g[a].emplace_back(b, c);
            g[b].emplace_back(a, c);
        }
    }

    auto dis = defvec<ll>(LLINF, k, 2, n);
    auto wf = defvec<ll>(LLINF, k * 2, k * 2);
    FOR(i, 0, k) {
        auto [a0, b0, c0] = edge[r[i]];
        FOR(dir, 0, 2) {
            dis[i][dir][a0] = 0;
            PQ<pair<ll, int>> dik;
            dik.emplace(0, a0);
            while (!dik.empty()) {
                auto [d, cur] = dik.top();
                dik.pop();
                if (dis[i][dir][cur] < d)continue;
                for (auto [to, cost] : g[cur]) {
                    if (!chmin(dis[i][dir][to], d + cost))continue;
                    dik.emplace(d + cost, to);
                }
            }
            FOR(j, 0, k) {
                chmin(wf[i * 2 + dir][j * 2 + 0], dis[i][dir][get<0>(edge[r[j]])]);
                chmin(wf[i * 2 + dir][j * 2 + 1], dis[i][dir][get<1>(edge[r[j]])]);
            }
            swap(a0, b0);
        }
    }
    FOR(p, 0, k * 2)FOR(i, 0, k * 2)FOR(j, 0, k * 2)chmin(wf[i][j], wf[i][p] + wf[p][j]);
    auto dp = defvec<ll>(LLINF, k, 2, 1 << k);
    PQ<tuple<ll, int, int, int>> dik;
    FOR(i, 0, k)FOR(dir, 0, 2) {
        dp[i][dir][0] = dis[i][dir][0];
        dik.emplace(dis[i][dir][0], i, dir, 0);
    }
    while (!dik.empty()) {
        auto [d, i, dir, bit] = dik.top();
        dik.pop();
        if (dp[i][dir][bit] < d)continue;
        auto [a0, b0, c0] = edge[r[i]];
        if (chmin(dp[i][dir ^ 1][bit | (1 << i)], d + c0)) {
            dik.emplace(d + c0, i, dir ^ 1, bit | (1 << i));
        }
        FOR(j, 0, k)FOR(dir2, 0, 2) {
            if (chmin(dp[j][dir2][bit], d + wf[i * 2 + dir][j * 2 + dir2])) {
                dik.emplace(d + wf[i * 2 + dir][j * 2 + dir2], j, dir2, bit);
            }
        }
    }
    ll ans = LLINF;
    FOR(i, 0, k)FOR(dir, 0, 2)chmin(ans, dp[i][dir][(1 << k) - 1] + dis[i][dir][n - 1]);
    print(ans);

    return 0;
}