#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
// define
#define endl "\n"
#ifdef LOCAL
#define lout cerr
#else
ostream devnull(0);
#define lout devnull
#endif
// rep
// Inspired by:
// https://github.com/kurokoji/.cpp-Template/blob/master/template/template2.cpp
#define GET_MACRO(_1, _2, _3, _4, NAME, ...) NAME
#define rep(...)                                 \
  GET_MACRO(__VA_ARGS__, rep4, rep3, rep2, rep1) \
  (__VA_ARGS__)
#define rep1(n) rep2(_, n)
#define rep2(i, n) rep3(i, 0, n)
#define rep3(i, a, n) rep4(i, a, n, 1)
#define rep4(i, a, n, d) rep5(i, a, n, d, <)
#define rep5(i, a, n, d, o) \
  for (auto i = decltype(n)(a), i##_len = (n); i o i##_len; i += (d))

#define rrep(...)                                    \
  GET_MACRO(__VA_ARGS__, rrep4, rrep3, rrep2, rrep1) \
  (__VA_ARGS__)
#define rrep1(a) rrep2(_, a)
#define rrep2(i, a) rrep3(i, a, 0)
#define rrep3(i, a, n) rrep4(i, a, n, -1)
#define rrep4(i, a, n, d) rep5(i, (a)-1, n, d, >=)

#define repc(...)                                    \
  GET_MACRO(__VA_ARGS__, repc4, repc3, repc2, repc1) \
  (__VA_ARGS__)
#define repc1(n) repc2(_, n)
#define repc2(i, n) repc3(i, 0, n)
#define repc3(i, a, n) repc4(i, a, n, 1)
#define repc4(i, a, n, d) rep5(i, a, n, d, <=)
// alias
// typedef long long ll;
// typedef long long lint;
// typedef pair<int, int> pii;
// typedef pair<lint, lint> pll;
using ll = long long;
using lint = long long;
// func
template <class C>
void vcin(C &c)
{
  for (auto &&a : c)
  {
    cin >> a;
  }
}
template <class C, class D>
void vcin(C &c, D &d)
{
  for (auto it1 = c.begin(), it2 = d.begin(); it1 != c.end() && it2 != d.end();
       it1++, it2++)
  {
    cin >> *it1 >> *it2;
  }
}
template <class C>
void vcout(const C &c, const string delimiter = " ")
{
  for (auto it = c.begin(); it != c.end(); it++)
  {
    if (it != c.begin())
      cout << delimiter;
    cout << *it;
  }
}
template <class T = int>
inline T input()
{
  T x;
  cin >> x;
  return (x);
}
template <typename T>
inline void chmax(T &x, const T y)
{
  if (x < y)
    x = y;
}
template <typename T>
inline void chmin(T &x, const T y)
{
  if (x > y)
    x = y;
}
#define CPPV (__cplusplus / 100 % 100) //C++ Version
#if CPPV >= 14

// http://beet-aizu.hatenablog.com/entry/2018/04/08/145516
template <typename T>
vector<T> make_v(size_t a) { return vector<T>(a); }
template <typename T, typename... Ts>
auto make_v(size_t a, Ts... ts)
{
  return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}
template <typename T, typename V>
typename enable_if<is_class<T>::value == 0>::type fill_v(T &t, const V &v)
{
  t = v;
}
template <typename T, typename V>
typename enable_if<is_class<T>::value != 0>::type fill_v(T &t, const V &v)
{
  for (auto &e : t)
    fill_v(e, v);
}
#endif

constexpr int INF = 1 << 24;
constexpr lint LINF = 1LL << 48;

#define dump(x) lout << #x << " = " << (x) << endl;
inline lint bit(lint n)
{
  return 1LL << n;
}

void solve();

signed main()
{
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout << fixed << setprecision(15);

  solve();

  return 0;
}

void solve()
{
  int n, m, R;
  cin >> n >> m >> R;
  vector<int> r(R);
  rep(i, R)
  {
    cin >> r[i];
    r[i]--;
  }
  vector<int> a(m), b(m), c(m);
  rep(i, m)
  {
    cin >> a[i] >> b[i] >> c[i];
    a[i]--;
    b[i]--;
  }

  auto d = make_v<lint>(n, n);
  fill_v(d, LINF);

  rep(x, n)
  {
    d[x][x] = 0;
  }
  rep(i, m)
  {
    d[a[i]][b[i]] = c[i];
    d[b[i]][a[i]] = c[i];
  }
  rep(k, n) rep(i, n) rep(j, n)
  {
    chmin(d[i][j], d[i][k] + d[k][j]);
    d[j][i] = d[i][j];
  }

  sort(r.begin(),r.end());

  lint ans = LINF;
  do
  {
    lint cost = 0;
    rep(i, R - 1)
    {
      cost += min(d[r[i]][r[i + 1]], d[r[i + 1]][r[i]]);
    }
    chmin(ans, cost);
  } while (next_permutation(r.begin(), r.end()));

  cout << ans << endl;
}


Measured memory_bytes: 768