#include<bits/stdc++.h>

using namespace std;

#define ll long long
#define rep(i, l, r) for(ll (i) = (l); (i) < (r); ++ (i))
#define per(i, r, l) for(ll (i) = (r); (i) > (l); -- (i))

#define MAXN (int)1e5+5
int low[MAXN], dfn[MAXN], dfs_clock;
bool isbridge[MAXN];
vector<int> G[MAXN];
int cnt_bridge;
int father[MAXN];
ll nums;
bool isable[MAXN];
bool vis[MAXN];

void tarjan(int u, int fa) {
    father[u] = fa;
    low[u] = dfn[u] = ++dfs_clock;
    for (int i = 0; i < G[u].size(); i++) {
        int v = G[u][i];
        if (!dfn[v]) {
            tarjan(v, u);
            low[u] = min(low[u], low[v]);
            if (low[v] > dfn[u]) {
                isbridge[v] = true;
                ++cnt_bridge;
            }
        } else if (dfn[v] < dfn[u] && v != fa) {
            low[u] = min(low[u], dfn[v]);
        }
    }
}

void dfs(int u) {
    vis[u] = true;
    for (int v : G[u]) {
        if (!vis[v]) {
            if(u==1)nums=0;
            dfs(v);
        }
    }
    nums++;
    if (isbridge[u]) {
        if (nums % 2)isable[u] = true;
    }
}

int main() {
    int n, m;
    cin >> n >> m;
    ll s = 0;
    priority_queue<pair<ll, pair<int, int>>, vector<pair<ll, pair<int, int>>>, greater<>> pq;
    for (int i = 1; i <= m; i++) {
        int x, y, w;
        cin >> x >> y >> w;
        G[x].push_back(y);
        G[y].push_back(x);
        pq.push({w, {x, y}});
        s += w;
    }
    if (m % 2 == 0) {
        cout << s;
        return 0;
    }
    tarjan(1, 1);
    dfs(1);
//    for (int i = 1; i <= n; i++) {
//        cerr << i << " " << father[i] << " " << isable[i] << endl;
//    }
    auto is_b = [&](int x, int y) {
        return father[x] == y && isbridge[x] || father[y] == x && isbridge[y];
    };
    auto is_a = [&](int x, int y) {
        return father[x] == y && isable[x] || father[y] == x && isable[y];
    };
    while (true) {
        auto [w, e] = pq.top();
        auto &[x, y] = e;
        pq.pop();
        if (is_b(x, y) && !is_a(x, y)) {
            continue;
        }
        cout << s - w;
        return 0;
    }
}

//12 13
//1 2 6
//2 3 7
//2 4 8
//3 5 9
//4 5 10
//5 6 1
//6 7 2
//6 8 3
//7 9 4
//8 9 5
//9 10 6
//1 11 7
//10 12 7