# include "bits/stdc++.h" using namespace std; using LL = long long; using ULL = unsigned long long; const double PI = acos(-1); templateconstexpr T INF() { return ::std::numeric_limits::max(); } templateconstexpr T HINF() { return INF() / 2; } template T_char TL(T_char cX) { return tolower(cX); }; template T_char TU(T_char cX) { return toupper(cX); }; const int vy[] = { -1, -1, -1, 0, 1, 1, 1, 0 }, vx[] = { -1, 0, 1, 1, 1, 0, -1, -1 }; const int dx[4] = { -1,0,1,0 }, dy[4] = { 0,-1,0,1 }; int popcnt(unsigned long long n) { int cnt = 0; for (int i = 0; i < 64; i++)if ((n >> i) & 1)cnt++; return cnt; } int d_sum(LL n) { int ret = 0; while (n > 0) { ret += n % 10; n /= 10; }return ret; } int d_cnt(LL n) { int ret = 0; while (n > 0) { ret++; n /= 10; }return ret; } LL gcd(LL a, LL b) { if (b == 0)return a; return gcd(b, a%b); }; LL lcm(LL a, LL b) { LL g = gcd(a, b); return a / g*b; }; # define ALL(qpqpq) (qpqpq).begin(),(qpqpq).end() # define UNIQUE(wpwpw) (wpwpw).erase(unique(ALL((wpwpw))),(wpwpw).end()) # define LOWER(epepe) transform(ALL((epepe)),(epepe).begin(),TL) # define UPPER(rprpr) transform(ALL((rprpr)),(rprpr).begin(),TU) # define FOR(i,tptpt,ypypy) for(LL i=(tptpt);i<(ypypy);i++) # define REP(i,upupu) FOR(i,0,upupu) # define INIT std::ios::sync_with_stdio(false);std::cin.tie(0) # pragma warning(disable:4996) int V; int E; struct edge { int from, to, cost; }; typedef pair PP; vector e; int Par[100000]; int Rank[100000]; void init(int n) { for (int i = 0; i < n; i++) { Par[i] = i; Rank[i] = 0; } } int find(int x) { if (Par[x] == x) { return x; } else { return Par[x] = find(Par[x]); } } void unite(int x, int y) { x = find(x); y = find(y); if (x == y) return; if (Rank[x] < Rank[y]) { Par[x] = y; } else { Par[y] = x; if (Rank[x] == Rank[y])Rank[x]++; } } bool same(int x, int y) { return find(x) == find(y); } // ソート時に比較するための関数 bool comp(const edge& e1, const edge& e2) { return e1.cost < e2.cost; } int kruskal() { sort(e.begin(), e.end(), comp); int ans = 0; for (int i = 0; i < E; i++) { if (!same(e[i].from, e[i].to)) { unite(e[i].from, e[i].to); ans += e[i].cost; } } return ans; } int k; int a[101010], b[101010], c[101010]; int sum; int main() { cin >> V >> E >> k; init(V + 1); for (int i = 0; i < E; i++) { cin >> a[i] >> b[i] >> c[i]; sum += c[i]; e.push_back(edge{ a[i],b[i],c[i] }); } REP(i, k) { int e; cin >> e; e--; sum -= c[e]; unite(a[e], b[e]); } cout << sum - kruskal() << endl; }