#include <bits/stdc++.h>

using namespace std;
using i64 = long long;

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, m;
  cin >> n >> m;
  int idx = 0;
  vector<vector<pair<int, int>>> adj(n + 1);
  vector<int> edge(2 * m), d(n + 1);
  i64 sum = 0;
  for (int i = 0; i < m; ++i) {
    int u, v, w;
    cin >> u >> v >> w;
    adj[u].emplace_back(v, idx++);
    adj[v].emplace_back(u, idx++);
    d[u]++; d[v]++;
    edge[idx - 1] = edge[idx - 2] = w;
    sum += w;
  }

  if (m % 2 == 0) {
    cout << sum << "\n";
    return 0;
  }

  int time = 0;
  vector<int> dfn(n + 1), low(n + 1), siz(n + 1);
  vector<tuple<int, int, int>> bridge;
  vector<bool> tag(2 * m);
  auto tarjan = [&](auto self, int u, int e)->void {
    dfn[u] = low[u] = ++time;
    for (auto [v, i] : adj[u]) {
      if (!dfn[v]) {
        self(self, v, i);
        low[u] = min(low[u], low[v]);
        if (dfn[u] < low[v]) {                 
          siz[i] = siz[i ^ 1] = (d[v] - 1) / 2;        
          bridge.emplace_back(v, u, edge[i]);
          tag[i] = tag[i ^ 1] = 1;
          // cerr << u << "<->" << v << " is bridge\n";
        }
        d[u] += d[v];
      } else if (i != (e ^ 1)) {
        low[u] = min(low[u], dfn[v]);
      }
    }
    return;
  };

  tarjan(tarjan, 1, -1);

  i64 ans = 0;
  for (int i = 0; i < 2 * m; ++i) {
    if (!tag[i] || (tag[i] && siz[i] % 2 == 0 && (m - siz[i] - 1) % 2 == 0)) {
      ans = max(ans, sum - edge[i]);
    }
  }

  cout << ans << "\n";
  return 0;
}