import java.util.*; import java.io.*; import java.math.*;
public class Main{
	//Don't have to see. start------------------------------------------
	static class InputIterator{
		ArrayList<String> inputLine = new ArrayList<String>(1024);
		int index = 0; int max; String read;
		InputIterator(){
			BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
			try{
				while((read = br.readLine()) != null){
					inputLine.add(read);
				}
			}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<Integer, String> CONVSTR = new HashMap<Integer, String>();
	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(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<String> nextStrArray(){return myconv(next(), 8);}
	static ArrayList<String> nextCharArray(){return myconv(next(), 0);}
	static ArrayList<Integer> nextIntArray(){
		ArrayList<String> input = nextStrArray(); ArrayList<Integer> ret = new ArrayList<Integer>(input.size());
		for(int i = 0; i < input.size(); i++){
			ret.add(Integer.parseInt(input.get(i)));
		}
		return ret;
	}
	static ArrayList<Long> nextLongArray(){
		ArrayList<String> input = nextStrArray(); ArrayList<Long> ret = new ArrayList<Long>(input.size());
		for(int i = 0; i < input.size(); i++){
			ret.add(Long.parseLong(input.get(i)));
		}
		return ret;
	}
	static String myconv(Object list, int no){//only join
		String joinString = CONVSTR.get(no);
		if(list instanceof String[]){
			return String.join(joinString, (String[])list);
		}else if(list instanceof ArrayList){
			return String.join(joinString, (ArrayList)list);
		}else{
			throw new ClassCastException("Don't join");
		}
	}
	static ArrayList<String> myconv(String str, int no){//only split
		String splitString = CONVSTR.get(no);
		return new ArrayList<String>(Arrays.asList(str.split(splitString)));
	}
	public static void main(String[] args){
		CONVSTR.put(8, " "); CONVSTR.put(9, "\n"); CONVSTR.put(0, "");
		solve();flush();
	}
	//Don't have to see. end------------------------------------------
  static long output;
  static long[][] kyori;
  static int[] travel;
	static void solve(){//Here is the main function
      ArrayList<Integer> one = nextIntArray();
      int N = one.get(0);
      int M = one.get(1);
      int R = one.get(2);
      long max = 1L << 50;
      kyori = new long[N][N];
      travel = new int[R];
      HashSet<Integer> allTravel = new HashSet<Integer>();
      ArrayList<Integer> tmp2 = nextIntArray();
      for(int i = 0; i < R; i++){
        travel[i] = tmp2.get(i) - 1;
        allTravel.add(travel[i]);
      }
      for(int i = 0; i < N; i++){
        for(int j = 0; j < N; j++){
          kyori[i][j] = max;
        }
      }
      for(int i = 0; i < M; i++){
        ArrayList<Integer> tmp = nextIntArray();
        kyori[tmp.get(0) - 1][tmp.get(1) - 1] = (long)tmp.get(2);
        kyori[tmp.get(1) - 1][tmp.get(0) - 1] = (long)tmp.get(2);
      }
      for(var k = 0; k < N; k++){
        for(var i = 0; i < N; i++){
          for(var j = 0; j < N; j++){
            if(kyori[i][j] > kyori[i][k] + kyori[k][j]){
               kyori[i][j] = kyori[i][k] + kyori[k][j];
            }
          }
        }
      }
      for(int i = 0; i < N; i++){
        for(int j = 0; j < N; j++){
          myerr(kyori[i][j]);
        }
      }
      output = max;

      for(int i = 0; i < R; i++){
        dfs(travel[i], allTravel, new Long("0"));
      }
      myout(output);
	}
	//Method addition frame start

static void dfs(int parent, HashSet<Integer> set, long moved){
  HashSet<Integer> tmpSet = (HashSet<Integer>)set.clone();
  tmpSet.remove(parent);
  if(tmpSet.size() == 0){
    output = Math.min(output, moved);
    return;
  }
  Iterator it = tmpSet.iterator();
  while(it.hasNext()){
    int nextTravel = (int)it.next();
    if(nextTravel == parent){
      continue;
    }
    dfs(nextTravel, tmpSet, moved + kyori[parent][nextTravel]);
  }
}

	//Method addition frame end
}


Measured memory_bytes: 61524