#include<bits/stdc++.h>
#define int long long
#define mkp make_pair
#define min(x,y) x<y?x:y
#define max(x,y) x>y?x:y
#define D(x) cout<<#x<<": "<<x<<endl;
#define DE(x) cout<<#x<<": "<<x<<" ";
using namespace std;
inline int read(){int x=0;bool f=1;char ch=getchar();while(!isdigit(ch)) f=ch=='-'?0:1,ch=getchar();while(isdigit(ch)) x=(x<<1)+(x<<3)+(ch^48),ch=getchar();return f?x:-x;}
inline void write(int x){if(x<0) putchar('-'),x=-x;if(x>9) write(x/10);putchar(x%10+48);}
constexpr int N=1e5+10,inf=0x3f3f3f3f3f3f3f3f;
vector<pair<int,int> > G[N];
struct node{
	int u,v,w;
	bool opt;
}edge[N*6];
bool cmp(node x,node y){return x.w<y.w;}
int n,m,f[N],d[N],fa[N][20],maxn[N][20],maxn1[N][20];
int find(int x){return (x==f[x]?x:f[x]=find(f[x]));}
void dfs(int u,int f){
	d[u]=d[f]+1;
	fa[u][0]=f;
	for(auto x:G[u]){
		int v=x.first,w=x.second;
		if(v==f) continue;
		maxn1[v][0]=-inf;
		maxn[v][0]=w;
		dfs(v,u);
	}
}
pair<int,int> calc(int u,int v){
	if(d[u]<d[v]) swap(u,v);
	int ret1=-inf,ret2=-inf;
	for(int i=17;i>=0;i--){
		if(d[fa[u][i]]>=d[v]){
			ret1=max(ret1,maxn[u][i]);
			if(maxn1[u][i]!=maxn[u][i]){
				ret2=max(ret2,maxn1[u][i]);
			}
			u=fa[u][i];
		}
	}
	if(u==v) return {ret1,ret2};
	for(int i=17;i>=0;i--){
		if(fa[u][i]!=fa[v][i]){
			ret1=max(ret1,max(maxn[u][i],maxn[v][i]));
			if(maxn[u][i]!=ret1){
				ret2=max(ret2,maxn[u][i]);
			}else if(maxn1[u][i]!=ret2){
				ret2=max(ret2,maxn1[u][i]);
			}
			if(maxn[v][i]!=ret1){
				ret2=max(ret2,maxn[v][i]);
			}else if(maxn1[v][i]!=ret2){
				ret2=max(ret2,maxn1[v][i]);
			}
			u=fa[u][i];
			v=fa[v][i];
		}
	}
	ret1=max(ret1,max(maxn[u][0],maxn[v][0]));
	if(maxn[u][0]!=ret1){
		ret2=max(ret2,maxn[u][0]);
	}else if(maxn1[u][0]!=ret2){
		ret2=max(ret2,maxn1[u][0]);
	}
	if(maxn[v][0]!=ret1){
		ret2=max(ret2,maxn[v][0]);
	}else if(maxn1[v][0]!=ret2){
		ret2=max(ret2,maxn1[v][0]);
	}
	return {ret1,ret2};
}
signed main(){
	n=read(),m=read();
	for(int i=1;i<=m;i++) edge[i].u=read(),edge[i].v=read(),edge[i].w=read();
	for(int i=1;i<=n;i++) f[i]=i;
	sort(edge+1,edge+1+m,cmp);
	int cnt=0,sum=0,ans=inf;
	for(int i=1;i<=m;i++){
		int u=edge[i].u,v=edge[i].v,w=edge[i].w;
		if(find(u)!=find(v)){
			G[u].push_back({v,w});
			G[v].push_back({u,w});
			u=find(u),v=find(v);
			f[u]=v;
			sum+=w;
			edge[i].opt=true;
			if(++cnt==n-1) break;
		}
	}
	d[1]=1;
	dfs(1,0);
	for(int i=1;i<18;i++){
		for(int u=1;u<=n;u++){
			fa[u][i]=fa[fa[u][i-1]][i-1];
			maxn[u][i]=max(maxn[u][i-1],maxn[fa[u][i-1]][i-1]);
			maxn1[u][i]=min(maxn[u][i-1],maxn[fa[u][i-1]][i-1]);
			if(maxn[u][i]==maxn1[u][i]){
				maxn1[u][i]=max(maxn1[u][i-1],maxn1[fa[u][i-1]][i-1]);
			}
			if(maxn[u][i]==maxn1[u][i]){
				maxn1[u][i]=min(maxn1[u][i-1],maxn1[fa[u][i-1]][i-1]);
			}
			if(maxn1[u][i]==maxn[u][i]) maxn1[u][i]=-inf;
		}
	}
	for(int i=1;i<=m;i++){
		if(edge[i].opt==false){
			pair<int,int> t=calc(edge[i].u,edge[i].v);
			int u=t.first,v=t.second;
			if(u<edge[i].w) ans=min(ans,sum-u+edge[i].w);
			else ans=min(ans,sum-v+edge[i].w);
		}
	}
	cout<<ans<<endl;
	return 0;
}






























/***********************************************
 *                   _ooOoo_                   *
 *                  o8888888o                  *
 *                  88" . "88                  *
 *                  (| o O |)                  *
 *                  O\  ^  /O                  *
 *               ____/`---'\____               *
 *             .'  \\|     |//  `.             *
 *            /  \\|||  :  |||//  \            *
 *           /  -||||| -:- |||||-  \           *
 *           |    | *   -   * |    |           *
 *           | \_|  ''\---/''  |   |           *
 *           \  .-\__  `-`  ___/-. /           *
 *         ___`. .'  /--.--\  `. . __          *
 *      ."" '<  `.___\_<|>_/___.'  >'"".       *
 *     | | :  `- \`.;`\ _ /`;.`/ - ` : | |     *
 *     \  \ `-.   \_ __\ /__ _/   .-` /  /     *
 *======`-.____`-.___\_____/___.-`____.-'======*
 *                   `=---='                   *
 *^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^*
             佛祖保佑       永无BUG
   本程序已经经过开光处理，绝无可能再产生bug
 **********************************************/