#include <bits/stdc++.h>

#define endl '\n'
#define pii pair<int,int>
#define mp make_pair
#define ll long long
using namespace std;
const int N = 1e5 + 10;
vector <pii> G[N];
int n,m;
ll ans;

int low[N],dfn[N],cntt[N],fat[N],qwq[N];
bool bri[N];

int hd[N],to[N],nxt[N],tot = 1;
ll val[N];
void add(int x,int y,int w) {
	to[++tot] = y;nxt[tot] = hd[x];val[tot] = w;hd[x] = tot;
}
void addedge(int x,int y,int w) {
	add(x,y,w);add(y,x,w);
}

int dfscnt;
void tarjan(int x,int ine) {
    dfn[x] = low[x] = ++dfscnt;
    for (int i = hd[x];i;i = nxt[i]) {
        int y = to[i];
        if (!dfn[y]) {
            tarjan(y,i);
            cntt[x] += cntt[y]+1;
            low[x] = min(low[x],low[y]);
            if (low[y] > dfn[x]) bri[i] = bri[i ^ 1] = 1,qwq[i] = qwq[i^1] = y;
        } else if (i != (ine ^ 1)) {
            low[x] = min(low[x],dfn[y]);
        }
    }
}

void solve() {
	cin >> n >> m;
	for (int i = 1;i <= m;++i) {
		ll u,v,w;
		cin >> u >> v >> w;
		addedge(u,v,w);
		ans += (ll)w;
	}
	tarjan(1,0);
	ll qe = 0x3f3f3f3f;
	for (int i = 2;i <= tot;i += 2) {
		if (bri[i]) {
			if (cntt[qwq[i]] % 2 == 0) {
				qe = min(qe,val[i]);
			}
		} else {
			qe = min(qe,val[i]);
		}
	}
	//for (int i = 1;i <= n;++i) printf("%d ",cntt[i]);
	//printf("qwq:%d\n",qe);
	if (m % 2) printf("%lld\n",ans-qe);
	else printf("%lld",ans);
}
/*
6
1234 2345
1234 0123
1234 2267
1234 3401
1234 1344
1234 2468
*/
signed main() {
	//ios::sync_with_stdio(false);
	//cin.tie(nullptr);
	//cout.tie(nullptr);
	int T = 1;
	while (T--) solve();
}