#include <bits/stdc++.h>
#define NMAX 2005
using namespace std;

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

struct muchie
{
    int nod;
    int cost;
    bool operator < (const muchie &A) const
    {
        return A.cost<cost;
    }
};

int n, m, k;
vector<muchie> L[NMAX];
int dist[NMAX];
bool viz[NMAX];
int c[20];
int adj[20][20];
int dp[35000][20];

void Dijkstra(int start_i)
{
    int start = c[start_i];
    priority_queue<muchie> q;
    muchie aux;
    aux.nod = start, aux.cost = 0;
    q.push(aux);
    for(int i=1; i<=n; i++)
        dist[i] = INT_MAX;
    dist[start] = 0;
    while(!q.empty())
    {
        aux = q.top();
        q.pop();
        int nod = aux.nod;
        for(auto it: L[nod])
        {
            if(dist[it.nod] == 0 || dist[nod] + it.cost < dist[it.nod])
            {
                dist[it.nod] = dist[nod] + it.cost;
                aux.nod = it.nod;
                aux.cost = dist[nod] + it.cost;
                q.push(aux);
            }
        }
    }
    // for(int i=1; i<=n; i++)
    //     cout<<dist[i]<<" ";
    for(int i=1; i<=k; i++)
        adj[start_i][i] = dist[c[i]];
    //cout<<"\n";
}

int main()
{
    fin>>n>>m>>k;
    for(int i=1; i<=k; i++)
        fin>>c[i];
    for(int i=1; i<=m; i++)
    {
        int x, y;
        muchie aux;
        fin>>x>>y>>aux.cost;
        aux.nod = y;
        L[x].push_back(aux);
        aux.nod = x;
        L[y].push_back(aux);
    }
    c[0] = 1;
    Dijkstra(0);
    for(int i=1; i<=k; i++)
        dp[1<<(i-1)][i] = dist[c[i]];
    for(int i=1; i<=k; i++)
        Dijkstra(i);
    // for(int i=1; i<k; i++)
    // {
    //     for(int j=i+1; j<=k; j++)
    //         cout<<adj[i][j]<<" ";
    //     cout<<"\n";
    // }
    for(int s=0; s<=(1<<k); s++)
    {
        for(int i=1; i<=k; i++)
        {
            if(s & (1<<(i-1)))
            {
                for(int j=1; j<=k; j++)
                {
                    if(!(s & (1<<(j-1))))
                    {
                        dp[s | (1<<(j-1))][j] = min(dp[s | (1<<(j-1))][j], dp[s][i] + adj[i][j]);
                    }
                }
            }
        }
    }
    c[0] = n;
    Dijkstra(0);
    int rasp = INT_MAX;
    for(int i=1; i<=k; i++)
        rasp = min(rasp, dp[(1<<k)-1][i] + dist[c[i]]);
    fout<<rasp;
    return 0;
}