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

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

vector<pair<int, int>> L[2005];
bitset<2005> v;
vector<int> d;
priority_queue<pair<int, int>> q;
int n, m, k;
int localitate[2005];
int dis[15][2005];
int Total;
int st[15];

void Dijkstra(int k)
{
    d.assign(n + 1, 2e9);
    int i, x;
    d[k] = 0;
    q.push({0, k});
    while(!q.empty())
    {
        k = q.top().second;
        q.pop();
        for(auto w : L[k])
        {
            int dis = w.first;
            int nod = w.second;
            if(d[nod] > d[k] + dis)
            {
                d[nod] = d[k] + dis;
                q.push({-d[nod], nod});
            }
        }
    }
}

void Afis(int n)
{
    for (int i = 1; i <= n; i++)
        fout << st[i] << " ";
    fout << "\n";
}

void Back(int top, int sum)
{
    if(top == k + 1)
    {
        //Afis(top - 1);
        Total = min(sum + dis[st[top - 1]][n], Total);
    }
    else
    {
        int i;
        if(top == 1)
        {
            for(i=1; i<=k; i++)
                if(v[i] == 0)
                {
                    v[i] = 1;
                    st[top] = i;
                    Back(top + 1, sum + d[localitate[i]]);
                    v[i] = 0;
                }
        }
        else
        {
            for(i=1; i<=k; i++)
                if(v[i] == 0)
                {
                    v[i] = 1;
                    st[top] = i;
                    Back(top + 1, sum + dis[st[top -1]][localitate[i]]);
                    v[i] = 0;
                }
        }
    }
}

int main()
{
    Total = 2e9;
    int i, x, y, c, j;
    fin >> n >> m;
    fin >> k;
    for(i=1; i<=k; i++)
        fin >> localitate[i];
    for(i=1; i<=m; i++)
    {
        fin >> x >> y >> c;
        L[x].push_back({c, y});
        L[y].push_back({c, x});
    }
    d.resize(n + 1);
    sort(localitate + 1, localitate + k + 1);
    for(i=1; i<=k; i++)
    {
        Dijkstra(localitate[i]);
        for(j=1; j<=n; j++)
            dis[i][j] = d[j];
    }
    Dijkstra(1);
    if(k != 0) Back(1, 0);
    if(k != 0) fout << Total << " ";
    else fout << d[n];
    fin.close();
    fout.close();
    return 0;
}