#include <bits/stdc++.h>
using namespace std;
using ll = long long;

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

    ll n, m;
    cin >> n >> m;

    vector<vector<pair<ll,ll>>> graph(n);
    ll total = 0;

    for (ll i = 0; i < m; i++) {
        ll a, b, c;
        cin >> a >> b >> c;
        a--; b--;
        graph[a].push_back({b, c});
        graph[b].push_back({a, c});
        total += c;
    }

    // DFS az 1-es csúcsból (0 index)
    vector<ll> dist(n, -1);
    stack<ll> st;
    st.push(0);
    dist[0] = 0;

    while (!st.empty()) {
        ll u = st.top();
        st.pop();

        for (auto [v, w] : graph[u]) {
            if (dist[v] == -1) {
                dist[v] = dist[u] + w;
                st.push(v);
            }
        }
    }

    ll longest = 0;
    for (ll i = 0; i < n; i++)
        longest = max(longest, dist[i]);

    cout << 2 * total - longest;
}