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

using namespace std;

ifstream f("ubuntzei.in");
ofstream g("ubuntzei.out");

int n, m, k;

priority_queue < pair <int, int>, vector <pair <int, int> >, greater <pair <int, int> > > q;

vector <int> loc, cost;

vector <vector <pair <int, int> > > a;

vector <bool> viz;

void dijkstra(int popas)
{
    for (int i = 1; i <= n; ++i) {
        viz[i] = 0;
        cost[i] = 1 << 30;
    }

    cost[popas] = 0;
    q.push({0, popas});

    while (!q.empty()) {
        pair <int, int> nod = q.top();

        q.pop();

        if (viz[nod.second]) {
            continue;
        }

        viz[nod.second] = 1;

        for (auto vecin : a[nod.second]) {
            if (vecin.second + nod.first < cost[vecin.first]) {
                cost[vecin.first] = vecin.second + nod.first;
                q.push({cost[vecin.first], vecin.first});
            }
        }
    }
}

int main()
{
    f >> n >> m >> k;

    a.resize(n + 1), loc.resize(k + 2), viz.resize(n + 1, 0), cost.resize(n + 1, (1 << 30));

    for (int i = 1; i <= k; ++i) {
        int x;
        f >> x;
        loc[i] = x;
    }

    for (int i = 1; i <= m; ++i) {
        int x, y, z;

        f >> x >> y >> z;

        a[x].push_back({y, z});
        a[y].push_back({x, z});
    }

    loc[0] = 1;
    ++k;
    loc[k] = n;

    vector <vector <int> > matCost(k + 1, vector <int> (k + 1, (1 << 30)));

    for (int i = 0; i <= k; ++i) {
        dijkstra(loc[i]);

        for (int j = 0; j <= k; ++j) {
            matCost[i][j] = matCost[j][i] = cost[loc[j]];
        }
    }

    vector <vector <int> > dp((1 << (k + 1)), vector <int> (k + 1, (1 << 30)));

    dp[0][0] = 0;

    for (int mask = 0; mask < (1 << (k + 1)); ++mask) {
        for (int i = 0; i <= k; ++i) {
            if (mask & (1 << i)) {
                for (int j = 0; j <= k; ++j) {
                    dp[mask][i] = min(dp[mask][i], dp[mask ^ (1 << i)][j] + matCost[i][j]);
                }
            }
        }
    }

    g << dp[(1 << (k + 1)) - 1][k];

    return 0;
}