import core.bitop, std.algorithm, std.ascii, std.bigint, std.conv, std.math,
    std.functional, std.numeric, std.range, std.stdio, std.string, std.random,
    std.typecons, std.container, std.format;

// dfmt off
T lread(T = long)(){return readln.chomp.to!T();}
T[] lreads(T = long)(long n){return generate(()=>readln.chomp.to!T()).take(n).array();}
T[] aryread(T = long)(){return readln.split.to!(T[])();}
void scan(TList...)(ref TList Args){auto line = readln.split();
foreach (i, T; TList){T val = line[i].to!(T);Args[i] = val;}}
alias sread = () => readln.chomp();enum MOD = 10 ^^ 9 + 7;
alias PQueue(T, alias less = "a<b") = BinaryHeap!(Array!T, less);
// dfmt on

void main()
{
    long N, M, R;
    scan(N, M, R);
    auto r = aryread();
    auto G = new long[][](N, N);
    foreach (ref row; G)
        row[] = long.max / 4;
    foreach (i; 0 .. N)
        G[i][i] = 0;
    foreach (i; 0 .. M)
    {
        long A, B, C;
        scan(A, B, C);
        A--, B--;
        G[A][B] = G[B][A] = C;
    }
    foreach (i; 0 .. N)
        foreach (j; 0 .. N)
            foreach (k; 0 .. N)
                if (G[i][k] + G[k][j] < G[i][j])
                {
                    G[i][j] = G[i][k] + G[k][j];
                }
    r[] -= 1;
    r.sort();
    long ans = long.max;
    do
    {
        long d;
        foreach (i; 0 .. R - 1)
            d += G[r[i]][r[i + 1]];
        ans = ans.min(d);
    }
    while (nextPermutation(r));
    writeln(ans);
}
