#include <bits/stdc++.h>
using namespace std;

#define repeat(i, x) for (int64_t i = 0; (i) < (int64_t)(x); (i)++)

// tubo28 is god
struct uf_tree {
    std::vector<int> parent;
    int __size;
    uf_tree(int size_) : parent(size_, -1), __size(size_) {}
    void unite(int x, int y) {
        if ((x = find(x)) != (y = find(y))) {
            if (parent[y] < parent[x]) std::swap(x, y);
            parent[x] += parent[y];
            parent[y] = x;
            __size--;
        }
    }
    bool is_same(int x, int y) { return find(x) == find(y); }
    int find(int x) { return parent[x] < 0 ? x : parent[x] = find(parent[x]); }
    int size(int x) { return -parent[find(x)]; }
    int size() { return __size; }
};

namespace TaskE {
    struct Edge {
        int u, v;
        int64_t cost;

        bool operator<(const Edge& e) const {
            return cost < e.cost;
        }
    };

    int n_, m_, k_;

    void solve() {
        cin >> n_ >> m_ >> k_;

        int64_t sum = 0;
        vector<Edge> edges(m_);
        repeat (i, m_) {
            cin >> edges[i].u >> edges[i].v >> edges[i].cost;
            edges[i].u--;
            edges[i].v--;

            sum += edges[i].cost;
        }

        uf_tree uf(n_);

        int64_t cost = 0;
        repeat (i, k_) {
            int e;
            cin >> e; e--;

            uf.unite(edges[e].u, edges[e].v);
            cost += edges[e].cost;
        }

        sort(edges.begin(), edges.end());

        for (auto& e : edges) {
            if (!uf.is_same(e.u, e.v)) {
                uf.unite(e.u, e.v);
                cost += e.cost;
            }
        }

        cout << sum - cost << endl;
    }
}

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    TaskE::solve();

    return 0;
}