#include <cstdio>
#include <algorithm>
using namespace std;

const int maxm = 200000;
const int maxn = 100000;
struct Node{
	int nxt;
	int to;
	int w;
};
struct Graph{
	int n;
	Node edge[maxm * 2 + 10];
	int head[maxn + 10];
	int top;
	void Init(int n){
		this->n = n;
		top = 0;
		for(int i = 1; i <= n; ++i){
			head[i] = 0;
		}
	}
	void AddEdge(int u, int v, int w){
		++top;
		edge[top].nxt = head[u];
		edge[top].to = v;
		edge[top].w = w;
		head[u] = top;
		return ;
	}
}p1;

int dfn[maxn + 10];
int lown[maxn + 10];
int topt;
int cnt[maxn + 10];
bool isBridge[maxm * 2 + 10];
int Tarjan(int u, int fa){
	dfn[u] = lown[u] = ++topt;
	cnt[u] = 0;
	int ch = 0;
	for(int i = p1.head[u]; i; i = p1.edge[i].nxt){
		int v = p1.edge[i].to;
		if(v != fa){
			cnt[u] = cnt[u] + 1;
			if(dfn[v] == 0){
				lown[u] = min(lown[u], Tarjan(v, u));
				if(dfn[u] < lown[v]){
					isBridge[i] = 1;
					isBridge[((i - 1) ^ 1) + 1] = 1;
				}
				cnt[u] = cnt[u] + cnt[v];
			}
			else{
				lown[u] = min(lown[u], dfn[v]);
			}
		}
	}
	return lown[u];
}

int main(){
	int n, m;
	scanf("%d%d", &n, &m);
	p1.Init(n);
	int u, v, w;
	long long sum = 0;
	for(int i = 1; i <= m; ++i){
		scanf("%d%d%d", &u, &v, &w);
		p1.AddEdge(u, v, w);
		p1.AddEdge(v, u, w);
		sum = sum + w;
	}
	int ans = 1000000009;
	for(int i = 1; i <= p1.top; i = i + 2){
		if(isBridge[i]){
			if(cnt[p1.edge[i].to] % 2 == 0){
				ans = std::min(ans, p1.edge[i].w);
			}
		}
		else{
			ans = std::min(ans, p1.edge[i].w);
		}
	}
	if(m % 2 == 0){
		printf("%lld", sum);
	}
	else{
		printf("%lld", sum - ans);
	}
	return 0;
}