#include <cstdio>
#include <vector>
#include <queue>

using namespace std;

const int NMAX = 2000;
const int KMAX = 15;


struct drum
{
    int dest;
    int lung;

    drum ()
    {
        dest = 0;
        lung = 0;
    }

    drum (int dest, int lung)
    {
        this->dest = dest;
        this->lung = lung;
    }
};

int n, m, k, tata;
int dist[KMAX + 1][NMAX + 1], oras[NMAX + 1], cost[(1 << (KMAX + 1))][NMAX + 1];

vector <drum> v[NMAX + 1];

struct cmp
{
    bool operator () (const int &a, const int &b)
    {
        return dist[tata][a] > dist[tata][b];
    }
};

priority_queue <int, vector <int>, cmp> hp;


void dijkstra (int nod)
{
    int fiu;

    hp.push (nod);

    while (!hp.empty ())
    {
        nod = hp.top ();
        hp.pop ();

        for (int i = 0; i < v[nod].size (); ++i)
        {
            fiu = v[nod][i].dest;

            if (!dist[tata][fiu] || dist[tata][fiu] > dist[tata][nod] + v[nod][i].lung)
            {
                dist[tata][fiu] = dist[tata][nod] + v[nod][i].lung;
                hp.push (fiu);
            }
        }
    }
}

void din (int stare, int ultim)
{
    for (int i = 0; i < k; ++i)
    {
        if ((stare & (1 << i)) == 0 && dist[ultim][oras[i]])
        {
            int x = stare + (1 << i);

            if (!cost[x][i] || cost[x][i] > cost[stare][ultim] + dist[ultim][oras[i]]);
            {
                cost[x][i] = cost[stare][ultim] + dist[ultim][oras[i]];

                din (x, i);
            }
        }
    }
}

int main ()
{
    freopen ("ubuntzei.in", "r", stdin);
    freopen ("ubuntzei.out", "w", stdout);

    int x, y, c;

    scanf ("%d%d%d", &n, &m, &k);

    for (int i = 0; i < k; ++i)
        scanf ("%d", &oras[i]);

    for (int i = 0; i < m; ++i)
    {
        scanf ("%d%d%d", &x, &y, &c);

        v[x].push_back (drum (y, c));
        v[y].push_back (drum (x, c));
    }

    for (int i = 0; i < k; ++i)
    {
        tata = i;
        dijkstra (oras[i]);
    }

    tata = k;
    dijkstra (1);

    for (int i = 0; i < k; ++i)
    {
        cost[(1 << i)][i] = dist[k][oras[i]];

        din ((1 << i), i);
    }

    int sol = 2000000000;

    for (int i = 0; i < k; ++i)
    {
        if (cost[(1 << k) - 1][i] + dist[i][n] < sol)
            sol = cost[(1 << k) - 1][i] + dist[i][n];
    }

    printf ("%d\n", sol);

    return 0;
}