#include <bits/stdc++.h>
#define int long long
using namespace std;
const int N=5e5+10;
int n, m;
int zs[N];
int dfsn[N],low[N],fa[N],num;
bool bridge[N];
int h[N],ne[N],f[N],e[N],idx;
int ec[N],nc[N],hc[N],idc,cf[N];
int c[N],dcc;
void add(int a,int b,int w){
    f[idx]=w,e[idx]=b,ne[idx]=h[a],h[a]=idx++;
}
void add_c(int x,int y,int w){
    cf[idc]=w,ec[idc]=y,nc[idc]=hc[x],hc[x]=idc++;
    // cerr<<idc<<" ";
}
void tarjan(int x,int in_edge){
    dfsn[x]=low[x]=++num;
    for(int i=h[x];~i;i=ne[i]){
        int y=e[i];
        if(!dfsn[y]){
            tarjan(y,i);
            low[x]=min(low[x],low[y]);
            if(low[y]>dfsn[x]){
                bridge[i]=bridge[i^1]=true;//割边
            }
        }
        else if(i!=(in_edge^1)){
            low[x]=min(low[x],dfsn[y]);
        }
    }
}
int sz[N],scnt=0;;
int minn=1e18;
void dfs(int x){
    c[x]=dcc;scnt++;
    for(int i=h[x];~i;i=ne[i]){
        int y=e[i];
        if(c[y]||bridge[i])continue;
        dfs(y);
    }
}
void Dfs(int u,int far){
    for(int i=hc[u];~i;i=nc[i]){
        int v=ec[i];
        if(v==far)continue;
        Dfs(v,u);
        sz[u]+=sz[v];
        sz[u]++;
        if(sz[v]%2==0&&(m-1-sz[v])%2==0){
            minn=min(minn,f[i]);
        }
    }
}
void solve () {
    cin>>n>>m;
    int sum=0;
    memset(h,-1,sizeof h);
    memset(hc,-1,sizeof hc);
    for(int i=1;i<=m;i++){
        int u,v,w;
        cin>>u>>v>>w;
        sum+=w;
        add(u,v,w);
        add(v,u,w);
    }
    if((m%2)==0){
        cout<<sum<<endl;return ;
    }
    tarjan(1,0);
    for(int i=1;i<=n;i++){//缩点
        if(!c[i]){
            ++dcc;
            scnt=0;
            dfs(i);
            // sz[dcc]=scnt;
            // cerr<<sz[dcc]<<" ";
        }
    }
    for(int i=0;i<idx;i+=2){//建边
        int x=e[i],y=e[i^1];
        
        if(c[x]==c[y]){
            minn=min(minn,f[i]);
            sz[c[x]]++;
            continue;
            }
        add_c(c[x],c[y],f[i]);
        add_c(c[y],c[x],f[i]);
    }
    // cerr<<" 8";
    Dfs(1,-1);
    cout<<sum-minn;
}
signed main () {
    int T = 1; 
    std::ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
    //cin>>T;
    while (T --) solve ();
    return 0;
}