#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
struct dy{
	int x;
	int y;
	int z;
};
dy a[5010];
int father[1010],n,m,ans;
int cmp(const dy &a,const dy &b){
	if(a.z<=b.z)
		return 1;
	return 0;
}
int find(int x){
	if(father[x]!=x)
		father[x]=find(father[x]);
	return father[x];
}
int main(){
	ios::sync_with_stdio(false);
	scanf("%d%d",&n,&m);
	for(int i=1;i<=m;i++){
		cin>>a[i].x>>a[i].y>>a[i].z;
		ans+=a[i].z;
	}
	for(int i=1;i<=n;i++)
		father[i]=i;
	sort(a+1,a+m+1,cmp);
	for(int i=1;i<=m;i++){
		int fx=find(a[i].x);
		int fy=find(a[i].y);
		if(fx!=fy){
			father[fy]=fx;
			ans-=a[i].z;
		}
	}
	printf("%d",ans);
	return 0;
}