#include <bits/stdc++.h>
using namespace std;
#define int long long
int S, T;
constexpr int N = 4000 + 5, inf = 1e18;
struct MCF {
	struct edge { int v, f, c; };
	vector<edge> l;
	vector<int> e[N];
	void add(int u, int v, int f, int c) {
		e[u].push_back(l.size());
		l.push_back({v, f, c});
		e[v].push_back(l.size());
		l.push_back({u, 0, -c});
	}
	int dis[N], h[N], lim[N];
	array<int, 2> pre[N];
	bool dij() {
		fill(dis, dis + N, inf), fill(lim, lim + N, inf);
		priority_queue<pair<int, int>, vector<pair<int, int>>, greater<>> q;
		q.push({dis[S] = 0, S});
		while (!q.empty()) {
			auto [d, u] = q.top();
			q.pop();
			if (d != dis[u]) continue;
			for (int i : e[u]) {
				auto [v, f, c] = l[i];
				if (f && dis[v] > dis[u] + h[u] - h[v] + c) {
					dis[v] = dis[u] + h[u] - h[v] + c;
					lim[v] = min(lim[u], f);
					pre[v] = {u, i};
					q.push({dis[v], v});
				}
			}
		}
		for (int i = 0; i < N; i++) {
			h[i] = min(inf, h[i] + dis[i]);
		}
		return dis[T] < 2e9;
	}
	int flow() {
		int res = 0;
		while (dij()) {
			int fl = lim[T];
			for (int v = T; v != S; ) {
				auto [u, i] = pre[v];
				l[i].f -= fl;
				l[i ^ 1].f += fl;
				v = u;
			}
			res += fl * h[T];
		}
		return res;
	}
} g;
int n, m;
int sum[N];
signed main() {
	cin >> n >> m;
	int res = 0;
	for (int i = 1, u, v, w; i <= m; i++) {
		cin >> u >> v >> w;
		g.add(v, u, w, 1);
		sum[v] += w, sum[u] -= w;
		res += w;
	}
	S = n + 1, T = n + 2;
	for (int i = 1; i <= n; i++) {
		if (sum[i] > 0) {
			g.add(S, i, sum[i], 0);
		} else {
			g.add(i, T, -sum[i], 0);
		}
	}
	cout << res - g.flow() << "\n";
	return 0;
}