import java.util.Arrays;

public class Main {
  private static void solve() {
    int n = ni();
    int m = ni();
    int R = ni();
    int[] r = na(R);
    for (int i = 0; i < R; i ++) {
      r[i] --;
    }
    
    int[][] d = new int[n][n];
    for (int[] v : d) Arrays.fill(v, Integer.MAX_VALUE / 3);
    
    for (int i  = 0; i < m; i ++) {
      int a = ni() - 1;
      int b = ni() - 1;
      int c = ni();
      
      d[a][b] = c;
      d[b][a] = c;
    }
    
    int[][] len = wf(d);
    
    long min = Long.MAX_VALUE;
    for (int i = 0; i < R; i ++) {
      min = Math.min(min, dfs(r[i], 0, len, r, new boolean[n], 0));
    }
    System.out.println(min);
  }
  
  private static long dfs(int now, long l, int[][] len, int[] r, boolean[] visited, int cnt) {
    if (cnt == r.length - 1) {
      return l;
    }

    visited[now] = true;
    long ret = Long.MAX_VALUE;
    for (int next : r) {
      if (!visited[next]) {
        long x = dfs(next, l + len[now][next], len, r, visited, cnt + 1);
        ret = Math.min(ret, x);
      }
    }
    visited[now] = false;
    return ret;
  }

  public static int[][] wf(int[][] d)
  {
      int n = d.length;
      for(int k = 0;k < n;k++){
          for(int i = 0;i < n;i++){
              for(int j = 0;j < n;j++){
                  if(d[i][j] > d[i][k] + d[k][j]){
                      d[i][j] = d[i][k] + d[k][j];
                  }
              }
          }
      }
      return d;
  }
  public static void main(String[] args) {
    new Thread(null, new Runnable() {
      @Override
      public void run() {
        long start = System.currentTimeMillis();
        String debug = System.getProperty("debug");
        if (debug != null) {
          try {
            is = java.nio.file.Files.newInputStream(java.nio.file.Paths.get(debug));
          } catch (Exception e) {
            throw new RuntimeException(e);
          }
        }
        reader = new java.io.BufferedReader(new java.io.InputStreamReader(is), 32768);
        solve();
        out.flush();
        tr((System.currentTimeMillis() - start) + "ms");
      }
    }, "", 64000000).start();
  }

  private static java.io.InputStream is = System.in;
  private static java.io.PrintWriter out = new java.io.PrintWriter(System.out);
  private static java.util.StringTokenizer tokenizer = null;
  private static java.io.BufferedReader reader;

  public static String next() {
    while (tokenizer == null || !tokenizer.hasMoreTokens()) {
      try {
        tokenizer = new java.util.StringTokenizer(reader.readLine());
      } catch (Exception e) {
        throw new RuntimeException(e);
      }
    }
    return tokenizer.nextToken();
  }

  private static double nd() {
    return Double.parseDouble(next());
  }

  private static long nl() {
    return Long.parseLong(next());
  }

  private static int[] na(int n) {
    int[] a = new int[n];
    for (int i = 0; i < n; i++)
      a[i] = ni();
    return a;
  }

  private static char[] ns() {
    return next().toCharArray();
  }

  private static long[] nal(int n) {
    long[] a = new long[n];
    for (int i = 0; i < n; i++)
      a[i] = ni();
    return a;
  }

  private static int[][] ntable(int n, int m) {
    int[][] table = new int[n][m];
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        table[i][j] = ni();
      }
    }
    return table;
  }

  private static int[][] nlist(int n, int m) {
    int[][] table = new int[m][n];
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        table[j][i] = ni();
      }
    }
    return table;
  }

  private static int ni() {
    return Integer.parseInt(next());
  }

  private static void tr(Object... o) {
    if (is != System.in)
      System.out.println(java.util.Arrays.deepToString(o));
  }
}




Measured memory_bytes: 30992