#include "bits/stdc++.h"
#define ALL(obj) (obj).begin(),(obj).end()
#define RALL(obj) (obj).rbegin(),(obj).rend()
#define REP(i, n) for(int i = 0; i < (int)(n); i++)
#define REPR(i, n) for(int i = (int)(n); i >= 0; i--)
#define FOR(i,n,m) for(int i = (int)(n); i < int(m); i++)
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
const int INF = MOD - 1;
const ll LLINF = 4e18;

// 最小全域木 O(ElogV)?
struct Edge {
    ll cost, from,to;
    bool operator>(const Edge e)const {
        return this->cost > e.cost;
    }
    bool operator<(const Edge e)const {
        return this->cost < e.cost;
    }
};

//UnionFind
class UnionFind {
private:
    vector<int> par;
public:
    UnionFind(int n) {
        par.resize(n, -1);
    }

    int root(int x) {
        if (par[x] < 0) return x;
        return par[x] = root(par[x]);
    }

    bool unite(int x, int y) {
        int rx = root(x);
        int ry = root(y);
        if (rx == ry) return false;
        if (size(rx) < size(ry)) swap(rx, ry);
        par[rx] += par[ry];
        par[ry] = rx;
        return true;
    }

    bool same(int x, int y) {
        int rx = root(x);
        int ry = root(y);
        return rx == ry;
    }

    int size(int x) {
        return -par[root(x)];
    }
};

ll Kruskal(vector<Edge> G, int v) {
    sort(ALL(G));
    UnionFind uni(v);
    ll res = 0;
    REP(i, G.size()) {
        if (uni.unite(G[i].from, G[i].to)){
            res += G[i].cost;
        }
    }
    return res;
}

int main() {
    int n, m, k; cin >> n >> m >> k;
    vector<Edge> G(m);
    ll sum = 0;
    REP(i, m) {
        ll a, b, c; cin >> a >> b >> c;
        a--; b--;
        G[i] = {c,a,b};
        sum += c;
    }
    REP(i, k) {
        ll e; cin >> e;
        e--;
        sum -= G[e].cost;
        G[e] = {0,G[e].from,G[e].to};
    }
    cout << sum - Kruskal(G,n) << endl;
    getchar(); getchar();
}