#include <cstdint>
#include <fstream>
#include <queue>
#include <vector>

using namespace std;

using Pair = pair<int64_t, int64_t>;
using Matrix = vector<vector<int64_t>>;

using Graph = vector<vector<Pair>>;
using Heap = priority_queue<Pair, vector<Pair>, greater<Pair>>;

constexpr int64_t kInf = (1 << 30);

vector<int64_t> Dijkstra(const Graph &g, int64_t start)
{
  vector<int64_t> dist(g.size(), kInf);
  Heap heap;

  dist[start] = 0;
  heap.push({0, start});

  while (!heap.empty()) {
    auto distance = heap.top().first;
    auto node = heap.top().second;
    heap.pop();

    if (distance > dist[node]) {
      continue;
    }

    for (const auto &e : g[node]) {
      auto next = e.first;
      auto new_distance = dist[node] + e.second;

      if (new_distance < dist[next]) {
        dist[next] = new_distance;
        heap.push({dist[next], next});
      }
    }
  }
  return dist;
}

Matrix GetDistances(const Graph &g, const vector<int64_t> &cities)
{
  Matrix dist(cities.size());
  for (size_t i = 0; i < cities.size(); ++i) {
    dist[i] = Dijkstra(g, cities[i]);
  }
  return dist;
}

int64_t CalcDist(const vector<int64_t> &cities, const Matrix &dist, vector<int64_t> ind)
{
  auto res = 0;
  auto last = cities[ind[0]];

  for (size_t i = 1; i < ind.size(); ++i) {
    auto city = cities[ind[i]];
    res += dist[last][city];
    last = city;
  }
  return res;
}

bool InVector(const vector<int64_t> &vec, int64_t size, int64_t val)
{
  for (int64_t i = 0; i < size; ++i) {
    if (vec[i] == val) {
      return true;
    }
  }
  return false;
}

void Back(vector<int64_t> &st, int64_t lev,
         const vector<int64_t> &cities,
         const Matrix &dist, int64_t &res)
{
  if (lev == 0) {
    st[0] = 0;
    Back(st, lev + 1, cities, dist, res);
    return;
  }

  if (lev + 1 == (int64_t)cities.size()) {
    st[lev] = cities.size() - 1;
    res = min(res, CalcDist(cities, dist, st));
    return;
  }

  for (size_t i = 1; i + 1 < cities.size(); ++i) {
    if (!InVector(st, lev, i)) {
      st[lev] = i;
      Back(st, lev + 1, cities, dist, res);
    }
  }
}

int64_t Solve(const Graph &g, const vector<int64_t> &cities)
{
  auto dist = GetDistances(g, cities);
  vector<int64_t> st(cities.size());

  int64_t res = kInf;
  Back(st, 0, cities, dist, res);
  return res;
}

int main()
{
  ifstream fin("ubuntzei.in");
  ofstream fout("ubuntzei.out");

  int64_t nodes, edges;
  fin >> nodes >> edges;

  int64_t ncities;
  fin >> ncities;

  vector<int64_t> cities(ncities + 2);
  cities[0] = 0;
  cities[ncities + 1] = nodes - 1;

  for (int64_t i = 1; i <= ncities; ++i) {
    fin >> cities[i];
    cities[i] -= 1;
  }

  Graph graph(nodes);
  for (int64_t i = 0; i < edges; ++i) {
    int64_t a, b, cost;
    fin >> a >> b >> cost;
    graph[a - 1].push_back({b - 1, cost});
    graph[b - 1].push_back({a - 1, cost});
  }

  auto res = Solve(graph, cities);
  fout << res << "\n";

  return 0;
}