#include<bits/stdc++.h>
using namespace std;
const long long N=1e5+10,M=2e5+10;
long long head[N], idx;
struct Edge{int to,nxt,d;}e[M<<1];
void add(int u, int v, int d) {e[++idx].to = v;e[idx].nxt=head[u];e[idx].d=d;head[u]=idx;}
int din[N],siz[N],ans,minn,cnt,sum;
int dfn[N],low[N],dfscnt;
void tarjan(int u,int fa)
{
    dfn[u]=low[u]=++dfscnt;
    siz[u]=din[u];
    for (int i=head[u];i;i=e[i].nxt) {
        int v=e[i].to, d = e[i].d;
        if (!dfn[v]) {
            tarjan(v,u); 
            siz[u]+=siz[v];
            low[u]=min(low[u],low[v]);
            if (low[v]>dfn[u]) {
                if ((((siz[v]-1)/2)&1)==0){minn=min(minn,d);}
            }else {minn=min(minn,d);}
        }else if (v!=fa){minn=min(minn,d);low[u]=min(low[u],dfn[v]);}
        if (dfn[u]<dfn[v]){cnt++;}
    }
}

int main()
{
    int n,m;
    cin>>n>>m;
    for (int i=1;i<=m;i++){
        int u,v,d;
        cin>>u>>v>>d;
        ans+=d;
        add(u,v,d);add(v,u,d);
        din[u]++;din[v]++;
    }
    for (int i = 1; i <= n; i++) {
        if (!dfn[i]) {
            minn =2e9;cnt=0;sum=0;
            tarjan(i,0);
        }
    }
    cout<<ans;
    return 0;
}