#include <bits/stdc++.h>

using namespace std;
using ll = long long;
using VI = vector<int>;
using VL = vector<ll>;
using PII = std::pair<int, int>;
using PLL = std::pair<ll, ll>;

#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n)-1; i >= 0; i--)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define allpt(v) (v).begin(), (v).end()
#define allpt_r(v) (v).rbegin(), (v).rend()

const int mod = 1e9 + 7;
const string wsp = " ";
const string tb = "\t";
const string rt = "\n";

template <typename T>
void show1dvec(vector<T> v)
{
    int n = v.size() - 1;
    rep(i, n) cout << v[i] << wsp;
    cout << v[n] << rt;
    return;
}

template <typename T>
void show2dvec(vector<vector<T>> v)
{
    int n = v.size();
    rep(i, n) show1dvec(v[i]);
}

class Unionfind
{
    vector<int> p;

public:
    int find(int x);
    void unite(int x, int y);
    Unionfind(int n);
};

Unionfind::Unionfind(int n)
{
    for (int i = 0; i < n; i++)
    {
        p.push_back(i);
    }
}
int Unionfind::find(int x)
{
    while (p[x] != x)
    {
        p[x] = p[p[x]];
        x = p[x];
    }
    return x;
}

void Unionfind::unite(int x, int y)
{
    x = Unionfind::find(x);
    y = Unionfind::find(y);
    if (x != y)
    {
        p[x] = y;
    }
}

struct road
{
    int cost;
    int from;
    int to;
};

int main()
{

#ifdef DEBUG
    cout << "DEBUG MODE" << endl;
    ifstream in("input.txt"); //for debug
    cin.rdbuf(in.rdbuf());    //for debug
#endif

    int n, m, k, a, b, c;
    ll total_cost = 0, remain_cost = 0;
    cin >> n >> m >> k;
    vector<road> roads(m), sp_roads, ord_roads;
    vector<bool> sp_or_ord(m, false);
    Unionfind cities(n);

    rep(i, m)
    {
        cin >> a >> b >> c;
        roads[i] = (road){c, a - 1, b - 1};
        total_cost += c;
    }
    rep(i, k)
    {
        cin >> c;
        sp_or_ord[c - 1] = true;
    }
    rep(i, m)
    {
        if (sp_or_ord[i])
            sp_roads.push_back(roads[i]);
        else
            ord_roads.push_back(roads[i]);
    }
    rep(i, k)
    {
        cities.unite(sp_roads[i].from, sp_roads[i].to);
        remain_cost += sp_roads[i].cost;
    }


    sort(allpt(ord_roads), [](const road &a, const road &b) { if (a.cost != b.cost) return a.cost < b.cost; else return a.from < b.from; });

    for (auto z : ord_roads)
    {
        if (cities.find(z.from) != cities.find(z.to))
        {
            cities.unite(z.from, z.to);
            remain_cost += z.cost;
        }
    }

    cout << total_cost - remain_cost << rt;
    return 0;
}