#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define pb push_back
#define fi first
#define se second
const int N = 2e5 + 5;

vector<int>e[N];
array<int, 3>edge[N];
ll E[N];
ll val[N];

void solve() {
	int n, m;
	cin >> n >> m;
	for (int i = 1; i <= m; i++) {
		int u, v, w;
		cin >> u >> v >> w;
		edge[i] = {u, v, w};
		e[u].pb(i);
		e[v].pb(i);
	}
	for (int i = 1; i <= m; i++) {
		auto [u, v, w] = edge[i];
		E[i] += (int)e[u].size() - 1;
		E[i] += (int)e[v].size() - 1;
	}

	for (int i = 1; i <= m; i++) {
		val[i] += edge[i][2];
		if (E[i] == 1) {
			auto [u, v, w] = edge[i];
			for (auto t : e[u]) {
				if (t != i)
					val[t] += edge[i][2];
			}
			for (auto t : e[v]) {
				if (t != i)
					val[t] += edge[i][2];
			}
		}
	}
	ll s = 0;
	for (int i = 1; i <= m; i++)
		s += edge[i][2];
	if (m % 2) {
		ll mi = 1e18 + 10;
		for (int i = 1; i <= m; i++)
			mi = min(mi, val[i]);
		//cout << mi << ' ' << s << '\n';
		s -= mi;
	}
	cout << s << '\n';
}

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);

	int t = 1;
	//cin >> t;
	while (t--)
		solve();
	return 0;
}