代码求调

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

const int N = 2e5+10;
int n, k, fa[N], b[N];
long long ans;
bool flag[N];

struct node{
	int x, y, z;
} a[N];

bool cmp(node a, node b) {
	return a.z > b.z;
}

int find(int x) {
	if(fa[x] == x) return x;
	return fa[x] = x;
}

int main() {
	cin >> n >> k;
	for(int i = 1; i <= k; i++) {
		cin >> b[i];
		flag[b[i]] = 1;
		
	}
	for(int i = 1; i <= n-1; i++) {
		cin >> a[i].x >> a[i].y >> a[i].z;
	}
	sort(a+1, a+n, cmp);
	for(int i = 0; i <= n; i++) fa[i] = i;
	for(int i = 1; i <= n-1; i++) {
		int fx = find(a[i].x);
		int fy = find(a[i].y);
		if(flag[fx] && flag[fy]) {
			ans += a[i].z;
		}
		fa[fx]=fy;
		flag[fy] |= flag[fx];
	}
	cout << ans << endl;
	return 0;
}