#include <fstream>
#define Nmax 2009
#define Nmax 10009
#define INF 1<<30
#include <algorithm>

using namespace std;
ifstream f("ubuntzei.in");
ofstream g("ubuntzei.out");

int n,m,k,a[Nmax][Nmax],prieten[20],cost,x,y,sol;

void ReadInput()
{
    f>>n>>m>>k;
    for (int i=1; i<=k; ++i) f>>prieten[i];
    for (int i=1; i<=m; ++i)
    {
        f>>x>>y>>cost;
        a[x][y]=cost;
        a[y][x]=cost;
    }
}

void RoyFloyd(int a[Nmax][Nmax])
{
    for (int k=1; k<=n; ++k)
        for (int i=1; i<=n; ++i)
            for (int j=1; j<=n; ++j)
                if (i!=j && a[i][k]!=0 && a[k][j]!=0 && (a[i][j]==0 || a[i][k]+a[k][j]<a[i][j]))
                    a[i][j]=a[i][k]+a[k][j];
}

void Permut(int v[20],int k)
{
    sol=INF;
    do
    {
        //next_permutation(v+1, v+n+1);
        //for (int i=1; i<=k; ++i) g<<v[i]<<' ';
        //g<<'\n';
        int s=a[1][v[1]];
        for (int i=2; i<k; ++i)
        {
            s=s+a[v[i-1]][v[i]];
        }
        s=s+a[v[k]][n];
        if (s<sol) sol=s;
    }
    while (next_permutation(v+1,v+n+1));
}

void Close()
{
    f.close();
    g.close();
}

int main()
{
    ReadInput();
    RoyFloyd(a);
    /*for (int i=1; i<=n; ++i)
    {
        for (int j=1; j<=n; ++j) g<<a[i][j]<<' ';
        g<<'\n';
    }*/
    Permut(prieten,k);
    g<<sol<<'\n';
    Close();
    return 0;
}