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

using namespace std;

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

const int NMAX = 2000 + 1;
const int KMAX = 15 + 1;
const int INF = 0x3fffffff;

int n, m, k;
bool inQ[NMAX];
int distanta[NMAX], special[NMAX];
int distante[KMAX][NMAX];
vector <int> graf[NMAX], cost[NMAX];
int best[1 << KMAX][NMAX];


void citeste() {
    f >> n >> m >> k;
    int a, b, c;
    for (int i = 1; i <= k; i++) f >> special[i];
    for (int i = 1; i <= m; i++) {
        f >> a >> b >> c;
        graf[a].push_back(b); cost[a].push_back(c);
        graf[b].push_back(a); cost[b].push_back(c);
    }
}

void bellman_ford(int sursa) {
    queue <int> Q;
    Q.push(sursa);
    inQ[sursa] = true;
    int nod, d, fiu, l;
    for (int i = 1; i <= n; i++) distanta[i] = INF;
    distanta[sursa] = 0;

    while (!Q.empty()) {
        nod = Q.front();
        inQ[nod] = false;
        Q.pop();
        l = graf[nod].size();
        for (int i = 0; i < l; i++) {
            fiu = graf[nod][i];
            d = cost[nod][i] + distanta[nod];
            if (d < distanta[fiu]) {
                distanta[fiu] = d;
                if (!inQ[fiu]) {Q.push(fiu); inQ[fiu] = true;}
            }
        }
    }

}

void rezolva() {
    int nr_config = 1 << k;
    if (!k) bellman_ford(1);
    else {
        special[0] = 1;
        for (int i = 0; i <= k; i++) {
            bellman_ford(special[i]);
            for (int j = 0; j <= k; j++)
                distante[i][j] = distanta[special[j]];
            distante[i][k + 1] = distanta[n];
        }
    }
    for (int config = 0; config < nr_config; config++)
        for (int i = 0; i <= k; i++) best[config][i] = INF;
    best[0][0] = 0;
    for (int config = 1; config < nr_config; config++) {
        for (int i = 0; i < k; i++)
            if (config & (1 << i)) {
                int config2 = config - (1 << i);
                for (int j = 0; j <= k; j++)
                    best[config][i + 1] = min(best[config][i + 1], best[config2][j] + distante[j][i + 1]);
            }
    }
    int sol = INF;
    for (int i = 1; i <= k; i++)
        sol = min(sol, best[nr_config - 1][i] + distante[i][k + 1]);
    g << sol << '\n';
}

int main() {
    citeste();
    rezolva();
}