#include <bits/stdc++.h>

#define N 101000
using namespace std;


int n, m, mn, sum, sz[N];
vector<int> vec[N];
vector<int> val[N];

int dfs(int p, int f) {
    int mnp = 1e9;
    for(int i = 0;i < vec[p].size(); i++) {
        int v = vec[p][i], w = val[p][i];
        if(v == f) continue;
        mnp = min(mnp, dfs(v, p)); sz[p] += sz[v] + 1;
        if(sz[v] % 2 == 0) mnp = min(mnp, w); 
    }
    return mnp;
}
int main() {
    cin>>n>>m;
    sum = 0; mn = 1e9;
    for(int i = 1;i <= m; i++) {
        int u, v, w;
        cin>>u>>v>>w;
        mn = min(mn, w); sum += w;
        val[u].push_back(w);
        val[v].push_back(w);
        vec[u].push_back(v);
        vec[v].push_back(u);
    }
    if(m % 2) {
        if(m == n - 1) mn = dfs(1, 0);
        sum -= mn;
    }
    cout<<sum<<endl;
}