import java.util.*; import java.io.*; import java.math.*; public class Main{ //見なくていいよ ここから------------------------------------------ static class InputIterator{ ArrayList inputLine = new ArrayList<>(1024); int index = 0; int max; String read; InputIterator(){ try{ BufferedReader br = new BufferedReader(new InputStreamReader(System.in, "UTF-8")); while((read = br.readLine()) != null){ inputLine.addAll(Arrays.asList(read.split(" "))); } }catch(IOException e){} max = inputLine.size(); } boolean hasNext(){return (index < max);} String next(){ if(hasNext()){ return inputLine.get(index++); }else{ throw new IndexOutOfBoundsException("There is no more input"); } } } static HashMap CONVSTR = new HashMap<>(); static InputIterator ii = new InputIterator();//This class cannot be used in reactive problem. static PrintWriter out = new PrintWriter(System.out); static void flush(){out.flush();} static void myout(Object t){out.println(t);} static void myerr(Object... t){System.err.print("debug:");System.err.println(Arrays.deepToString(t));} static String next(){return ii.next();} static boolean hasNext(){return ii.hasNext();} static int nextInt(){return Integer.parseInt(next());} static long nextLong(){return Long.parseLong(next());} static double nextDouble(){return Double.parseDouble(next());} static ArrayList nextCharArray(){return myconv(next(), 0);} static ArrayList nextStrArray(int size){ ArrayList ret = new ArrayList<>(size); for(int i = 0; i < size; i++){ ret.add(next()); } return ret; } static ArrayList nextIntArray(int size){ ArrayList ret = new ArrayList<>(size); for(int i = 0; i < size; i++){ ret.add(Integer.parseInt(next())); } return ret; } static ArrayList nextLongArray(int size){ ArrayList ret = new ArrayList<>(size); for(int i = 0; i < size; i++){ ret.add(Long.parseLong(next())); } return ret; } @SuppressWarnings("unchecked") static String myconv(Object list, int no){//only join StringBuilder sb = new StringBuilder(""); String joinString = CONVSTR.get(no); if(list instanceof String[]){ return String.join(joinString, (String[])list); }else if(list instanceof long[]){ long[] tmp = (long[])list; if(tmp.length == 0){ return ""; } sb.append(String.valueOf(tmp[0])); for(int i = 1; i < tmp.length; i++){ sb.append(joinString).append(String.valueOf(tmp[i])); } return sb.toString(); }else if(list instanceof int[]){ int[] tmp = (int[])list; if(tmp.length == 0){ return ""; } sb.append(String.valueOf(tmp[0])); for(int i = 1; i < tmp.length; i++){ sb.append(joinString).append(String.valueOf(tmp[i])); } return sb.toString(); }else if(list instanceof ArrayList){ ArrayList tmp = (ArrayList)list; if(tmp.size() == 0){ return ""; } sb.append(tmp.get(0)); for(int i = 1; i < tmp.size(); i++){ sb.append(joinString).append(tmp.get(i)); } return sb.toString(); }else{ throw new ClassCastException("Don't join"); } } static ArrayList myconv(String str, int no){//only split String splitString = CONVSTR.get(no); return new ArrayList(Arrays.asList(str.split(splitString))); } static ArrayList myconv(String str, String no){ return new ArrayList(Arrays.asList(str.split(no))); } public static void main(String[] args){ CONVSTR.put(8, " "); CONVSTR.put(9, "\n"); CONVSTR.put(0, ""); solve();flush(); } //見なくていいよ ここまで------------------------------------------ //このコードをコンパイルするときは、「-encoding UTF-8」を指定すること static void solve(){//ここがメイン関数 int N = nextInt(); int M = nextInt(); int K = nextInt(); int[][] V = new int[N + 1007][N + 1007]; for(int i = 1; i <= N; i++){ Arrays.fill(V[i], 1000000000); V[i][i] = 0; } ArrayList klist = nextIntArray(K); Collections.sort(klist); HashMap E = new HashMap<>(); HashMap Eno = new HashMap<>(); String ks = ""; int now = 0; for(int i = 1; i <= M; i++){ int A = nextInt(); int B = nextInt(); int C = nextInt(); V[A][B] = C; V[B][A] = C; if(klist.contains(i)){ E.put(i, new Edge(A, B, C)); Eno.put(now, i); ks += now; now++; } } for(int k = 1; k <= N; k++){ for(int i = 1; i <= N; i++){ for(int j = 1; j <= N; j++){ V[i][j] = Math.min(V[i][j], V[i][k] + V[k][j]); } } } int output = 1000000000; while(!ks.equals("Final")){ for(int i = 0; i < (1 << K); i++){ ArrayList select = new ArrayList<>(); for(int j = 0; j < K; j++){ Edge key = E.get(Eno.get(ks.charAt(j) - '0')); if((i & (1 << j)) != 0){ select.add(new Edge(key.A, key.B, key.C)); }else{ select.add(new Edge(key.B, key.A, key.C)); } } int sum = 0; for(int j = 0; j < K; j++){ sum += select.get(j).C; if(j < K - 1){ sum += V[select.get(j).B][select.get(j + 1).A]; } } sum += V[1][select.get(0).A]; sum += V[select.get(K - 1).B][N]; output = Math.min(output, sum); } ks = nextPermutation(ks); } myout(output); } //メソッド追加エリア ここから static class Edge{ int A; int B; int C; Edge(int A, int B, int C){ this.A = A; this.B = B; this.C = C; } public String toString(){ return "A : " + A + ", B : " + B; } } static String nextPermutation(String s){ ArrayList list = new ArrayList<>(); for (int i = 0; i < s.length(); i++) list.add(s.charAt(i)); int pivotPos = -1; char pivot = 0; for (int i = list.size() - 2; i >= 0; i--) { if (list.get(i) < list.get(i + 1)) { pivotPos = i; pivot = list.get(i); break; } } //s is order by asc if (pivotPos == -1 && pivot == 0) return "Final"; int L = pivotPos + 1; int R = list.size() - 1; int minPos = -1; char min = Character.MAX_VALUE; for (int i = R; i >= L; i--) { if (pivot < list.get(i) && list.get(i) < min) { min = list.get(i); minPos = i; } } Collections.swap(list, pivotPos, minPos); Collections.sort(list.subList(L, R+1)); StringBuilder sb = new StringBuilder(); for (int i = 0; i < list.size(); i++) sb.append(list.get(i)); return sb.toString(); } //メソッド追加エリア ここまで }