#include <fstream>
#include <vector>
#include <queue>

using namespace std;

const int INF = 1e9;

struct muchie
{
    int vf, c;
};

void dijkstra(int x0, vector <vector <muchie>> &a, vector <int> &d)
{
    int n = (int)d.size();
    fill(d.begin(), d.end(), INF);
    d[x0] = 0;
    priority_queue <pair <int, int>, vector <pair <int, int>>, greater <pair <int, int>>> h;
    vector <bool> prelucrat(n, false);
    h.push({0, x0});
    while (!h.empty())
    {
        int x = h.top().second;
        h.pop();
        if (prelucrat[x])
        {
            continue;
        }
        prelucrat[x] = true;
        for (auto p: a[x])
        {
            int y = p.vf, c = p.c;
            if (d[x] + c < d[y])
            {
                d[y] = d[x] + c;
                h.push({d[y], y});
            }
        }
    }
}

int main()
{
    ifstream in("ubuntzei.in");
    ofstream out("ubuntzei.out");
    int n, m, k;
    in >> n >> m >> k;
    vector <vector <muchie>> a(n);
    vector <int> orase(k);
    for (int i = 0; i < k; i++)
    {
        int x;
        in >> x;
        x--;
        orase[i] = x;
    }
    for (int i = 0; i < m; i++)
    {
        int x, y, c;
        in >> x >> y >> c;
        x--;
        y--;
        a[x].push_back((muchie){y, c});
        a[y].push_back((muchie){x, c});
    }
    vector <vector<int>> c(k);
    vector <int> d(n);
    dijkstra(0, a, d);
    if (k == 0)
    {
        out << d[n-1] << "\n";
        in.close();
        out.close();
        return 0;
    }
    for (int i = 0; i < k; i++)
    {
        c[i].resize(k, INF);
    }
    vector <vector <int>> dp(1 << k);
    for (int i = 0; i < (1 << k); i++)
    {
        dp[i].resize(k, INF);
    }
    for (int i = 0; i < k; i++)
    {
        dp[1<<i][i] = d[orase[i]];
    }
    for (int i = 0; i < k; i++)
    {
        dijkstra(orase[i], a, d);
        for (int j = 0; j < k; j++)
        {
            c[i][j] = min(c[i][j], d[orase[j]]);
        }
    }
    for (int m = 1; m < (1 << k); m++)
    {
        for(int i = 0; i < k; i++)
        {
            if (m & (1 << i))
            {
                for (int j = 0; j < k; j++)
                {
                    if (j != i && (m & (1 << j)))
                    {
                        int m_fara_j = m ^ (1 << j);
                        dp[m][j] = min(dp[m][j], dp[m_fara_j][i] + c[i][j]);
                    }
                }
            }
        }
    }
    dijkstra(n - 1, a, d);
    int cost_min = INF;
    for (int i = 0; i < k; i++)
    {
        cost_min = min(cost_min, dp[(1<<k)-1][i] + d[orase[i]]);
    }
    out << cost_min << "\n";
    in.close();
    out.close();
    return 0;
}