// http://infoarena.ro/problema/ubuntzei
#include <fstream>
#include <vector>
using namespace std;

const int oo = 0x3f3f3f3f;
const int MAX_SIZE = 2001;
const int MAX_FRIENDS = 16;

ifstream in("ubuntzei.in");
ofstream out("ubuntzei.out");

int nodes,edges,nrFriends,minLength = oo;
int matrix[MAX_SIZE][MAX_SIZE];
int friends[MAX_FRIENDS];
int stack[MAX_FRIENDS];

void backtrack(int level);
bool stackValid(int level);
int pathLength();

int main() {
	in >> nodes >> edges >> nrFriends;

	for(int i=1;i<=nrFriends;i++)
		in >> friends[i];

	int from,to;
	for(int i=1;i<=edges;i++) {
		in >> from >> to;
		in >> matrix[from][to];
		matrix[to][from] = matrix[from][to];
	}

	for(int k=1;k<=nodes;k++)
		for(int i=1;i<=nodes;i++)
			for(int j=1;j<=nodes;j++)
				if(matrix[i][k] && matrix[k][j] && (!matrix[i][j] || matrix[i][j] > matrix[i][k] + matrix[k][j]) && i!=j)
					matrix[i][j] = matrix[i][k] + matrix[k][j];

	//nrFriends = 4;
	backtrack(1);

	out << minLength << "\n";

	return (0);
}

void backtrack(int level) {
	if(level <= nrFriends)
		for(int i=1;i<=nrFriends;i++) {
			stack[level] = i;

			if(stackValid(level)) {

				if(level == nrFriends) {
					/*for(int k=1;k<=level;k++)
						out << stack[k] << " ";
					out << "\n";*/
					minLength = min(minLength,pathLength());
				}

				backtrack(level+1);
			}
		}
}

bool stackValid(int level) {
	if(level > 1)
		for(int i=1;i<level;i++)
			for(int k=i+1;k<=level;k++)
				if(stack[i] == stack[k])
					return false;
	return true;
}

int pathLength() {
	int length = 0;

	length += matrix[1][friends[stack[1]]];
	for(int i=2;i<=nrFriends;i++)
		length += matrix[friends[stack[i-1]]][friends[stack[i]]];
	length += matrix[friends[stack[nrFriends]]][nodes];

	return length;
}