#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<vector>
using namespace std;

#define KM 300010
#define KN 100010
int N,M;
int f[KN];
struct EDGE{
	int fr,to,val;
}e[KM];
bool vis[KM];
vector<int> s;
bool my_cmp(const EDGE a,const EDGE b){
	return a.val<b.val;
}
int getfa(int tmp){
	return f[tmp]= tmp==f[tmp]? tmp: getfa(f[tmp]);
}
void init(){
	for(int i=1;i<=N;i++) f[i]=i;
}

void work(){
	
	scanf("%d %d",&N,&M);
	for(int i=1;i<=M;i++){
		scanf("%d %d %d",&e[i].fr,&e[i].to,&e[i].val);	
	}
	sort(e+1,e+1+M,my_cmp);
	
	init();
	int fr,to,val,base=0,forbid,ans=0,dudu=0x3f3f3f3f;
	for(int i=1;i<=M;i++){
		fr=e[i].fr,to=e[i].to,val=e[i].val;
		int a=getfa(fr),b=getfa(to);
		if(a==b) continue;
		s.push_back(i);
		f[a]=b;
		ans+=val;
	}
	
	for(int j=0;j<s.size();j++){
		forbid=s[j];
		init();
		base=0;
		for(int i=1;i<=M;i++) if(i!=forbid){
			fr=e[i].fr,to=e[i].to,val=e[i].val;
			int a=getfa(fr),b=getfa(to);
			if(a==b) continue;
			f[a]=b;
			base+=val;
		}
		if(base>ans) dudu=min(dudu,base);
	}
	
	printf("%d\n",dudu);
}

int main(){
	freopen("secmst.in","r",stdin);
	freopen("secmst.out","w",stdout);
	work();	
	return 0;
}