/*
https://infoarena.ro/problema/ubuntzei
*/
#include <fstream>
#include <vector>
#include <queue>
#include <algorithm>

using namespace std;

const int INF = 1e9;

struct muchie
{
    int x, y, c;
    int celalalt(int vf)
    {
        return (x + y - vf);
    }
};

int n;
vector <muchie> e;
vector <vector <int>> lst_a;

void dijkstra(int x_0, vector <int> &d)
{
    fill(d.begin(), d.end(), INF);
    priority_queue <pair <int, int>, vector <pair <int, int>>,
                   greater <pair <int, int>>> h;
    vector <bool> prel(n + 1, false);
    d[x_0] = 0;
    h.push({d[x_0], x_0});
    while (!h.empty())
    {
        int x = h.top().second;
        h.pop();
        if (!prel[x])
        {
            prel[x] = true;
            for (auto i: lst_a[x])
            {
                int y = e[i].celalalt(x), c = e[i].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 m, k;
    in >> n >> m >> k;
    vector <int> orase(k);
    for (auto &oras: orase)
    {
        in >> oras;
    }
    e.resize(m);
    lst_a.resize(n + 1);
    for (int i = 0; i < m; i++)
    {
        in >> e[i].x >> e[i].y >> e[i].c;
        lst_a[e[i].x].push_back(i);
        lst_a[e[i].y].push_back(i);
    }
    in.close();
    vector <int> d(n + 1);
    vector <vector <int>> cost(k, vector <int>(k, INF));
    vector <vector <int>> c(1 << k, vector <int>(k, INF));
    dijkstra(1, d);
    for (int i = 0; i < k; i++)
    {
        c[1<<i][i] = d[orase[i]];
    }
    for (int i = 0; i < k; i++)
    {
        dijkstra(orase[i], d);
        for (int j = 0; j < k; j++)
        {
            cost[i][j] = d[orase[j]];
        }
    }
    for (int s = 1; s < (1 << k); s++)
    {
        for (int i = 0; i < k; i++)
        {
            if (s & (1 << i))
            {
                int s_fara_i = (s ^ (1 << i));
                for (int j = 0; j < k; j++)
                {
                    if (s_fara_i & (1 << j))
                    {
                        c[s][i] = min(c[s][i],
                                      c[s_fara_i][j] + cost[i][j]);
                    }
                }
            }
        }
    }
    dijkstra(n, d);
    int cost_min = INF;
    for (int i = 0; i < k; i++)
    {
        cost_min = min(cost_min, c[(1<<k)-1][i] + d[orase[i]]);
    }
    out << cost_min << "\n";
    out.close();
    return 0;
}