import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


enum INF = 10L^^18;

void main() {
  try {
    for (; ; ) {
      const N = readInt;
      const M = readInt;
      const K = readInt;
      auto R = new int[K];
      foreach (k; 0 .. K) {
        R[k] = readInt - 1;
      }
      auto A = new int[M];
      auto B = new int[M];
      auto C = new long[M];
      foreach (i; 0 .. M) {
        A[i] = readInt - 1;
        B[i] = readInt - 1;
        C[i] = readLong;
      }
      
      auto G = new int[][N];
      foreach (i; 0 .. M) {
        G[A[i]] ~= i;
        G[B[i]] ~= i;
      }
      
      auto ss = new int[2 * K + 2];
      foreach (k; 0 .. K) {
        ss[2 * k + 0] = A[R[k]];
        ss[2 * k + 1] = B[R[k]];
      }
      ss[2 * K + 0] = 0;
      ss[2 * K + 1] = N - 1;
      
      auto dist = new long[][](2 * K + 2, N);
      foreach (x; 0 .. 2 * K + 2) {
        alias Entry = Tuple!(long, "c", int, "u");
        BinaryHeap!(Array!Entry, "a.c > b.c") que;
        dist[x][] = INF;
        dist[x][ss[x]] = 0;
        que.insert(Entry(0, ss[x]));
        for (; !que.empty; ) {
          const c = que.front.c;
          const u = que.front.u;
          que.removeFront;
          if (dist[x][u] == c) {
            foreach (i; G[u]) {
              const cc = c + C[i];
              const v = A[i] ^ B[i] ^ u;
              if (chmin(dist[x][v], cc)) {
                que.insert(Entry(cc, v));
              }
            }
          }
        }
        debug {
          writeln(ss[x], ": ", dist[x]);
        }
      }
      
      auto dp = new long[][](1 << K, 2 * K + 2);
      foreach (p; 0 .. 1 << K) {
        dp[p][] = INF;
      }
      dp[0][2 * K + 0] = 0;
      foreach (p; 0 .. 1 << K) {
        foreach (x; 0 .. 2 * K + 2) {
          foreach (k; 0 .. K) if (!(p >> k & 1)) {
            chmin(dp[p | 1 << k][2 * k + 1], dp[p][x] + dist[x][A[R[k]]] + C[R[k]]);
            chmin(dp[p | 1 << k][2 * k + 0], dp[p][x] + dist[x][B[R[k]]] + C[R[k]]);
          }
        }
      }
      long ans = INF;
      foreach (x; 0 .. 2 * K + 2) {
        chmin(ans, dp[(1 << K) - 1][x] + dist[x][N - 1]);
      }
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}