#include <bits/stdc++.h>
#define inf (1 << 30)

using namespace std;

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

int a[17], n, m, k;
vector <pair<int, int> > L[2005];
priority_queue <pair<int, int> > q;

void Citire()
{
    int x, p = 0, y, c;

    fin >> n >> m;
    fin >> k;

    for(int i = 1; i <= k; i++)
    {
        fin >> x;
        a[++p] = x;
    }

    a[0] = 1;
    a[++p] = n;
    k = p;

    for(int i = 1; i <= m; i++)
    {
        fin >> x >> y >> c;
        L[x].push_back({y, c});
        L[y].push_back({x, c});
    }
}

int drum[2005];
bitset <2005> viz;

void Dij(int nod)
{
    viz.reset();

    for(int i = 1; i <= n; i++) drum[i] = inf;
    drum[nod] = 0;

    q.push({-drum[nod], nod});

    while(!q.empty())
    {
        int el = q.top().second;
        q.pop();

        if(!viz[el])
        {
            viz[el] = 1;
            for(auto x : L[el])
            {
                int fiu = x.first;
                int cost = x.second;
                if(drum[fiu] > drum[el] + cost)
                {
                    drum[fiu] = drum[el] + cost;
                    q.push({-drum[fiu], fiu});
                }
            }
        }
    }
}

int dist[17][17];

void ConstruireDistante()
{
    for(int i = 0; i <= k; i++)
    {
        Dij(a[i]);

        for(int j = 0; j <= k; j++)
            dist[i][j] = drum[a[j]];
    }
}

int dp[17][(1 << 17)];

void Dinamica()
{
    dp[0][1] = 0;
    for(int i = 1; i <= (1 << k) - 1; i++)
        for(int j = 0; j <= k; j++)
            if((i & (1 << j)) != 0)
                for(int p = 0; p <= k; p++)
                    if((i & (1 << p)) == 0)
                        dp[p][i | (1 << p)] = min(dp[p][i | (1 << p)],
                                                  dp[j][i] + dist[j][p]);

    int sol = inf;

    for(int i = 0; i <= k; i++)
        sol = min(sol, dp[i][(1 << k) - 1] + dist[i][k]);

    fout << sol << "\n";
}

int main()
{
    Citire();

    for(int i = 0; i <= k; i++)
        for(int j = 0; j <= k; j++)
            dist[i][j] = inf;

    ConstruireDistante();

    for(int i = 0; i <= k; i++)
        for(int j = 1; j <= (1 << k) - 1; j++)
            dp[i][j] = inf;

    Dinamica();

    return 0;
}