/** gnu specific **/
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
/** contains everything I need in std **/
#include <bits/stdc++.h>

#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(S) ((int)S.size())
#define FOR(i, st_, n) for(int i = st_; i < n; ++i)
#define RFOR(i, n, end_) for(int i = (n)-1; i >= end_; --i)
#define x first
#define y second
#define pb push_back
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
typedef unsigned long long ull;
typedef long double LD;
typedef pair<ull, ull> pull;
using namespace __gnu_pbds;
typedef tree<ll, null_type, less<>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
using namespace std;
#ifdef ONPC
mt19937 rnd(228);
#else
mt19937 rnd(chrono::high_resolution_clock::now().time_since_epoch().count());
#endif

struct Edge
{
	int u,v;
	ll w;
};
struct DSU
{
    int n;
    vector<int> pr;

    DSU(int nn)
    {
	n = nn;
        pr = vector<int>(n, -1);
        for(int i = 0; i < n; ++i)
            pr[i] = i;
    }

    int get_parent(int v)
    {
        if(pr[v] == v)
            return v;
        return pr[v] = get_parent(pr[v]);
    }

    void make_union(int a, int b)
    {
        a = get_parent(a);
        b = get_parent(b);
        if(a != b)
        {
            pr[a] = b;
        }
    }
};

int solve()
{
	int n,m;
	if(!(cin>>n>>m))
		return 1;
	vector<vector<pll>> adj(n);
	vector<Edge> edges(m);
	for(auto& [u,v,w]: edges)cin>>u>>v>>w, --u,--v;
	for(auto [u,v,w]: edges)
	{
		adj[u].pb({v,w});
		adj[v].pb({u,w});
	}

	sort(all(edges),[](const Edge&e1, const Edge&e2) -> bool {
		return e1.w<e2.w;
	});
	auto dsu = DSU(n);
	ll msp=0;
	set<pii> msp_edges;
	for(auto [u,v,w]:edges)
	{
		if(dsu.get_parent(u) == dsu.get_parent(v))
			continue;
		msp += w;
		dsu.make_union(u,v);
		msp_edges.insert({u,v});
		msp_edges.insert({v,u});
	}
	ll res=msp;
	//cout << "msp="<<msp<< '\n';
	FOR(v,0,n)
	{
		ll W = 1e14;
		ll minW=1e14;
		for(auto [to, w]: adj[v])
		{
			if(msp_edges.find({v, to}) != msp_edges.end())
			{
				W = min(W,w);
			}
			else
			{
				minW=min(minW, w);
			}
		}
		if(W!=(ll)1e14&&minW!=(ll)1e14)
		{
			res = max(res,msp+minW-W);
		}
	}
	cout<<res<<'\n';
    return 0;
}

int32_t main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    int TET = 1e9;
    //cin >> TET;
    for (int i = 1; i <= TET; i++)
    {
        if (solve())
        {
            break;
        }
#ifdef ONPC
        cout << "__________________________" << endl;
#endif
    }
#ifdef ONPC
    cerr << endl << "finished in " << clock() * 1.0 / CLOCKS_PER_SEC << " sec" << endl;
#endif
}