#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
const int N=110,M=210,inf=0x3f3f3f3f;
struct node{
int a,b,dist;
bool operator<(const node &a)const
{
return dist<a.dist;
}
}edges[M];
int p[N];
int find(int x){
if(p[x]!=x)p[x]=find(p[x]);
return p[x];
}
int n,m;
int main(){
cin>>n>>m;
int sum=0,res=0;
for(int i=0;i<m;i++)
cin>>edges[i].a>>edges[i].b>>edges[i].dist;
sort(edges,edges+m);
for(int i=1;i<=n;i++)
p[i]=i;
for(int i=0;i<m;i++){
int a=edges[i].a,b=edges[i].b,c=edges[i].dist;
sum+=c;
a=find(a),b=find(b);
if(a!=b){
p[a]=b;
res+=c;
}
}
cout<<sum-res<<endl;
return 0;
}