#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic push
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic pop
using namespace std;
using namespace atcoder;
#define rep(i,n)for (int i = 0; i < int(n); ++i)
#define rrep(i,n)for (int i = int(n)-1; i >= 0; --i)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
template<class T> void chmax(T& a, const T& b) { a = max(a, b); }
template<class T> void chmin(T& a, const T& b) { a = min(a, b); }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;


template<class T>
std::vector<unsigned long long> dijkstra(std::vector<std::vector<std::pair<int,T>>>& to, int s=0) {
    const unsigned long long INF = 1002003004005006007;
    struct QueElem {
        int v;
        unsigned long long c;
        bool operator<(const QueElem a) const {return c > a.c;}
        QueElem(int v, unsigned long long c): v(v), c(c) {}
    };
    std::priority_queue<QueElem> q;
    std::vector<unsigned long long> dist(to.size(), INF);
    dist[s] = 0;
    q.emplace(s, 0);
    while(!q.empty()) {
        QueElem qe = q.top(); q.pop();
        int u = qe.v;
        unsigned long long c = qe.c;
        if (c > dist[u]) continue;
        for(auto vc: to[u]) {
            int v = vc.first;
            unsigned long long nc = c + vc.second;
            if (nc < dist[v]) {
                dist[v] = nc;
                q.emplace(v, nc);
            }
        }
    }
    return dist;
}

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, m, k;
  cin >> n >> m >> k;
  vector<vector<P>> to1(n);
  VI r(k);
  rep(i, k) cin >> r[i], r[i]--;
  sort(all(r));
  VI ps{0, n - 1};
  vector<tuple<int, int, int>> es(k);
  int nxt = 0;
  rep(i, m) {
    int a, b, c;
    cin >> a >> b >> c;
    a--, b--;
    ps.emplace_back(a);
    ps.emplace_back(b);
    to1[a].emplace_back(b, c);
    to1[b].emplace_back(a, c);
    if (nxt < k && i == r[nxt]) {
      es[nxt++] = {a, b, c};
    }
  }
  sort(all(ps));
  ps.erase(unique(all(ps)), ps.end());
  int sz = ps.size();
  VVI dist0(sz, VI(sz));
  rep(i, sz) {
    auto d = dijkstra(to1, ps[i]);
    rep(j, sz) {
      int c = d[ps[j]];
      dist0[i][j] = c;
    }
  }
  rep(i, k) {
    auto& [u, v, c] = es[i];
    u = lower_bound(all(ps), u) - ps.begin();
    v = lower_bound(all(ps), v) - ps.begin();
  }

  vector<vector<P>> to2((1 << k) * k * 2 + 2);
  int s = (1 << k) * k * 2, t = s + 1;
  rep(i, k) {
    auto [u, v, c] = es[i];
    to2[s].emplace_back(1 << i | (2 * i + 1) << k, dist0[0][u] + c);
    to2[s].emplace_back(1 << i | (2 * i + 0) << k, dist0[0][v] + c);
    to2[(1 << k) - 1 | (2 * i + 0) << k].emplace_back(t, dist0[u][sz - 1]);
    to2[(1 << k) - 1 | (2 * i + 1) << k].emplace_back(t, dist0[v][sz - 1]);
  }
  rep(i, k) rep(b, 2) {
    int u = b == 0 ? get<0>(es[i]) : get<1>(es[i]);
    rep(s, 1 << k) if (s >> i & 1) {
      rep(j, k) if (!(s >> j & 1)) {
        int ns = s | 1 << j;
        int x = get<0>(es[j]);
        int y = get<1>(es[j]);
        to2[s | (2 * i + b) << k].emplace_back(ns | (2 * j + 0) << k, dist0[u][y] + get<2>(es[j]));
        to2[s | (2 * i + b) << k].emplace_back(ns | (2 * j + 1) << k, dist0[u][x] + get<2>(es[j]));
      }
    }
  }
  cout << dijkstra(to2, s)[t] << '\n';
}