#include <bits/stdc++.h>
#include "atcoder/all"
#define debug cout << "OK" << endl;
template<typename T>
inline bool chmax(T& a, const T b) { if (a < b) { a = b; return true; } return false; }
template<typename T>
inline bool chmin(T& a, const T b) { if (a > b) { a = b; return true; } return false; }
inline int Code(char c) {
	if ('A' <= c and c <= 'Z')return (int)(c - 'A');
	if ('a' <= c and c <= 'z')return (int)(c - 'a');
	if ('0' <= c and c <= '9')return (int)(c - '0');
	assert(false);
}
using namespace std;
using namespace atcoder;
#define int long long
constexpr int MOD = 998244353;
constexpr int INF = (1LL << 63);
using minit = modint998244353;

template<typename T>
ostream& operator << (ostream& st, const vector<T>& v) {
	for (const T value : v) {
		st << value << " ";
	}
	return st;
}
template<typename T>
istream& operator >> (istream& st, vector<T>& v) {
	for (T& value : v) {
		st >> value;
	}
	return st;
}

//

//

void solve() {
	int N, M;
	cin >> N >> M;
	vector<pair<int, pair<int, int>>> E(M);
	for (int e = 0; e < M; e++) {
		int u, v, w;
		cin >> u >> v >> w;
		u--; v--;
		E[e] = { w,{u,v} };
	}
	sort(E.begin(), E.end());
	dsu d(N);
	int ans = 0;
	for (int i = 0; i < M; i++) {
		if (d.same(E[i].second.first, E[i].second.second))continue;
		ans += d.size(E[i].second.first) * d.size(E[i].second.second) * E[i].first;
		d.merge(E[i].second.first, E[i].second.second);
		if (d.size(0) == N) {
			cout << ans << endl;
			return;
		}
	}
	assert(false);
}
signed main() {
	int T = 1;
	// cin >> T;
	for (int i = 0; i < T; i++)
		solve();
	return 0;
}

/*
* わらびのコードこーどすぺーす
 (σ･∀･)σｹﾞｯﾂ!!
*/