//=================================
// Created on: 2018/10/19 21:58:40
//=================================
#include <bits/stdc++.h>
#define show(x) std::cerr << #x << " = " << x << std::endl
using ll = long long;
using ull = unsigned long long;
using ld = long double;
constexpr ll MOD = 1000000007LL;
template <typename T>
constexpr T INF = std::numeric_limits<T>::max() / 10;
std::mt19937 mt{std::random_device{}()};
class DisjointSets
{
public:
    DisjointSets(const std::size_t v) : parent(v), rank(v, 0), size(v, 1) { std::iota(parent.begin(), parent.end(), 0); }
    bool same(const std::size_t a, const std::size_t b) { return find(a) == find(b); }
    std::size_t find(const std::size_t a) { return parent[a] == a ? a : parent[a] = find(parent[a]); }
    void unite(std::size_t a, std::size_t b)
    {
        a = find(a), b = find(b);
        if (a == b) { return; }
        if (rank[a] < rank[b]) { std::swap(a, b); }
        if (rank[a] == rank[b]) { rank[a]++; }
        size[a] += size[b], parent[b] = a;
    }
    std::size_t getSize(const std::size_t a) { return size[find(a)]; }

private:
    std::vector<std::size_t> parent, rank, size;
};

int main()
{
    int N, M, K;
    std::cin >> N >> M >> K;
    using P = std::pair<int, int>;
    using PP = std::pair<ll, P>;
    std::vector<PP> edge(M);
    std::set<PP> e;
    DisjointSets uf(N);
    ll prev = 0;
    for (int i = 0; i < M; i++) {
        int a, b;
        ll c;
        std::cin >> a >> b >> c, a--, b--;
        edge[i] = {c, {a, b}}, prev += c;
    }
    ll sum = 0;
    for (int i = 0; i < K; i++) {
        int E;
        std::cin >> E, E--;
        uf.unite(edge[E].second.first, edge[E].second.second), e.insert(edge[E]), sum += edge[E].first;
    }
    std::sort(edge.begin(), edge.end());
    for (int i = 0; i < M; i++) {
        if (e.find(edge[i]) != e.end()) { continue; }
        const int a = edge[i].second.first, b = edge[i].second.second, c = edge[i].first;
        if (not uf.same(a, b)) { uf.unite(a, b), sum += c; }
    }
    std::cout << prev - sum << std::endl;
    return 0;
}