import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.net.ConnectException;
import java.rmi.dgc.Lease;
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.Deque;
import java.util.HashMap;
import java.util.HashSet;
import java.util.List;
import java.util.Map;
import java.util.NoSuchElementException;
import java.util.Objects;
import java.util.Set;
import java.util.Stack;
import java.util.TreeMap;
import java.util.TreeSet;

import static java.util.Comparator.*;

public class Main {
	public static void main(String[] args) {
		Main main = new Main();
		main.solve();
		main.out.close();
	}

	// ======================================================================
	final int INF = (int)(1e9);
	int[][] D;
	public void solve() {
		int N = ni();
		int M = ni();
		int R = ni();
		int[] r = new int[R];
		for (int i = 0; i < R; i++) {
			r[i] = ni() - 1;
		}
		D = new int[N][N];
		for (int i = 0; i < N; i++) {
			Arrays.fill(D[i], INF);
		}
		int a, b, c;
		for (int i = 0; i < M; i++) {
			a = ni() - 1;
			b = ni() - 1;
			c = ni();
			D[a][b] = c;
			D[b][a] = c;
		}
		int[][] dist = warshallFloyd(D);
		int ans = INF, wk;
		int from;
		Arrays.sort(r);
		do {
			wk = 0;
			from = r[0];
			for (int i = 1; i < R; i++) {
				wk += dist[from][r[i]];
				from = r[i];
			}
			ans = Math.min(ans, wk);
		} while (next_permutation(r));
		out.println(ans);
	}
	
	// 与えられた配列の中身を辞書順に、次の順列をセットする（次がなければ　false を返す）
	public boolean next_permutation(int[] a) {
		for (int i = a.length - 2; i >= 0; i--) {
			if (a[i] < a[i + 1]) {
				for (int j = a.length - 1;; j--) {
					if (a[i] < a[j]) {
						int temp = a[i];
						a[i] = a[j];
						a[j] = temp;
						for (i++, j = a.length - 1; i < j; i++, j--) {
							temp = a[i];
							a[i] = a[j];
							a[j] = temp;
						}
						return true;
					}
				}
			}
		}
		return false;
	}
	
	//
	// 全ての頂点間の最短距離を求める　Ｏ（Ｖ＾３）　Ｖ：頂点の数　→　多いと使えない
	//
	// 引数　　distance 　　は頂点から頂点への距離（頂点は０～　）　☆☆☆　接続していない距離は大きな値を設定しておく事　☆☆☆
	// 返り値　min_distance は全ての頂点から頂点への最短距離の配列（頂点は０～　）
	//
	//  ☆　負の閉路があれば、マイナスの最短距離が返される
	//
	public int[][] warshallFloyd(int[][] distance) {
		int node_number = distance.length;
		int[][] min_distance = new int[node_number][node_number];
		for (int i = 0; i < node_number; i++) {
			for (int j = 0; j < node_number; j++) {
				min_distance[i][j] = distance[i][j];
			}
		}
		for (int via = 0; via < node_number; via++) {
			for (int from = 0; from < node_number; from++) {
				for (int to = 0; to < node_number; to++) {
					min_distance[from][to] = Math.min(min_distance[from][to],
							min_distance[from][via] + min_distance[via][to]);
				}
			}
		}
		return min_distance;
	}
	// ------------------------------------------
	// ライブラリ
	// ------------------------------------------
	// Print
	private PrintWriter out = new PrintWriter(System.out);

	// Scanner
	private FastScanner scan = new FastScanner();

	int ni() {
		return scan.nextInt();
	}

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

	int[][] ni(int y, int x) {
		int[][] a = new int[y][x];
		for (int i = 0; i < y; i++) {
			for (int j = 0; j < x; j++) {
				a[i][j] = ni();
			}
		}
		return a;
	}

	long nl() {
		return scan.nextLong();
	}

	long[] nl(int n) {
		long[] a = new long[n];
		for (int i = 0; i < n; i++) {
			a[i] = nl();
		}
		return a;
	}

	long[][] nl(int y, int x) {
		long[][] a = new long[y][x];
		for (int i = 0; i < y; i++) {
			for (int j = 0; j < x; j++) {
				a[i][j] = nl();
			}
		}
		return a;
	}

	String ns() {
		return scan.next();
	}

	String[] ns(int n) {
		String[] a = new String[n];
		for (int i = 0; i < n; i++) {
			a[i] = ns();
		}
		return a;
	}

	String[][] ns(int y, int x) {
		String[][] a = new String[y][x];
		for (int i = 0; i < y; i++) {
			for (int j = 0; j < x; j++) {
				a[i][j] = ns();
			}
		}
		return a;
	}
}

class FastScanner {
	private final InputStream in = System.in;
	private final byte[] buffer = new byte[1024];
	private int ptr = 0;
	private int buflen = 0;

	private boolean hasNextByte() {
		if (ptr < buflen) {
			return true;
		} else {
			ptr = 0;
			try {
				buflen = in.read(buffer);
			} catch (IOException e) {
				e.printStackTrace();
			}
			if (buflen <= 0) {
				return false;
			}
		}
		return true;
	}

	private int readByte() {
		if (hasNextByte())
			return buffer[ptr++];
		else
			return -1;
	}

	private static boolean isPrintableChar(int c) {
		return 33 <= c && c <= 126;
	}

	public boolean hasNext() {
		while (hasNextByte() && !isPrintableChar(buffer[ptr]))
			ptr++;
		return hasNextByte();
	}

	public String next() {
		if (!hasNext())
			throw new NoSuchElementException();
		StringBuilder sb = new StringBuilder();
		int b = readByte();
		while (isPrintableChar(b)) {
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}

	public long nextLong() {
		if (!hasNext())
			throw new NoSuchElementException();
		long n = 0;
		boolean minus = false;
		int b = readByte();
		if (b == '-') {
			minus = true;
			b = readByte();
		}
		if (b < '0' || '9' < b) {
			throw new NumberFormatException();
		}
		while (true) {
			if ('0' <= b && b <= '9') {
				n *= 10;
				n += b - '0';
			} else if (b == -1 || !isPrintableChar(b)) {
				return minus ? -n : n;
			} else {
				throw new NumberFormatException();
			}
			b = readByte();
		}
	}

	public int nextInt() {
		long nl = nextLong();
		if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE)
			throw new NumberFormatException();
		return (int) nl;
	}

	public double nextDouble() {
		return Double.parseDouble(next());
	}
}


Measured memory_bytes: 22484