#include <bits/stdc++.h>
#include <atcoder/all>

using namespace std;
using ll = long long;
#define rep(i, s, t) for (ll i = s; i < (ll)(t); i++)
#define all(x) begin(x), end(x)
template <class T> bool chmin(T& x, T y) {
	return x > y ? (x = y, true) : false;
}
template <class T> bool chmax(T& x, T y) {
	return x < y ? (x = y, true) : false;
}

void solve() {
	int n, m;
	cin >> n >> m;
	vector<ll> v(n);
	rep(i, 0, m) {
		int a, b, c;
		cin >> a >> b >> c;
		a--, b--;
		v[a] += c;
		v[b] += c;
	}
	sort(all(v));
	reverse(all(v));
	ll ans = 0;
	rep(i, 0, n) {
		if (i & 1) ans -= v[i];
		else ans += v[i];
	}
	cout << ans / 2 << '\n';
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cout << fixed << setprecision(15);
	int t = 1;
	// cin >> t;
	while (t--) solve();
}