#include <bits/stdc++.h>
#define Maxn 200007
#define inf 200000007
using namespace std;
int read()
{
    int x=0,f=1;char ch=getchar();
    while (ch<'0'||ch>'9'){if (ch=='-') f=-1;ch=getchar();}
    while (ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
    return x*f;
}
int n,m,cnt;
int last[Maxn],pre[Maxn*2],other[Maxn*2],val[Maxn*2];
int fa[Maxn],rk[Maxn];
int find(int x)
{
    if (x==fa[x]) return fa[x];
    fa[x]=find(fa[x]);
    return fa[x];
}
void mdf(int x,int y)
{
    x=find(x),y=find(y);
    if (x==y) return;
    if (rk[x]<rk[y])
    {
        fa[x]=y;
        rk[y]+=rk[x];
    }
    else
    {
        fa[y]=x;
        rk[x]+=rk[y];
    }
}
void insert(int u,int v,int d)
{
    other[++cnt]=v,pre[cnt]=last[u],last[u]=cnt;
    val[cnt]=d;
}
int main()
{
    while (scanf("%d%d",&n,&m)==2)
    {
        memset(last,0,sizeof(last));
        memset(other,0,sizeof(other));
        memset(pre,0,sizeof(pre));
        memset(val,0,sizeof(val));
        cnt=0;
        for (int i=1;i<=n;i++)
            fa[i]=i,rk[i]=1;
        for (int i=1;i<=m;i++)
        {
            int u=read(),v=read(),d=read();
            if (find(u)!=find(v)) mdf(u,v);
            if (u!=v) insert(u,v,d);
            if (u!=v) insert(v,u,d);
        }
        int x=find(1);
        if (rk[x]<n) printf("%d\n",0);
        else
        {
            int ans=inf;
            for (int i=1;i<=n;i++)
            {
                int now=0;
                for (int q=last[i];q;q=pre[q])
                    now+=val[q];
                ans=min(ans,now);
            }
            printf("%d\n",ans);
        }
    }
    return 0;
}