0分，Kruskal求调(玄关)

#include <bits/stdc++.h>
#define IOS ios::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#define ll long long
using namespace std;
struct inf{
	int x,y,sum;
	bool operator <(const inf &z)const{return sum<z.sum;}
}cur;
int n,k,u,v,w,fa[105],fx,fy,ans,cnt;
priority_queue<inf>q;
int find(int x){
	if(fa[x]==x)return x;
	return fa[x]=find(fa[x]);
}
void bfs(){
	while(!q.empty()){
		cur=q.top(),q.pop(),fx=find(cur.x),fy=find(cur.y);
		if(fx==fy)continue;
		fa[fx]=fy,ans+=cur.sum;
	}
}
int main(){
	IOS;
	cin>>n>>k;
	for(int i=1;i<=n;i++)fa[i]=i;
	while(k--){
		cin>>u>>v>>w;
		if(w!=0)q.push({u,v,w}),cnt+=w;
	}
	bfs();
	cout<<cnt-ans;
	return 0;
}