#include <bits/stdc++.h>
namespace // my guiding star
{
#define filein(x) freopen(x".in", "r", stdin);
#define fileout(x) freopen(x, "w", stdout);
#define fileerr(x) freopen(x, "w", stderr);
#define file(x) freopen(x".in", "r", stdin), freopen(x".out", "w", stdout);
#define files(x) freopen(x".in", "r", stdin), freopen(x".ans", "w", stdout);
using namespace std;
#define cT const T&
template<typename T>
inline T chkmin(T& x, cT y){if (x > y) x = y; return x;}
template<typename T>
inline T chkmax(T& x, cT y){if (x < y) x = y; return x;}
template <typename T>
inline bool inrange(cT x, cT l, cT r){return (l <= x) && (x <= r);}
template <typename T>
inline bool inrange(cT l, cT r, cT L, cT R){return (L <= l) && (r <= R);}
#undef cT
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ldb;
typedef unsigned u32;
template <typename T>
using pr = pair<T, T>;
typedef pr<int> pii;
typedef pr<ll> pll;
typedef pr<db> pdd;
typedef complex<double> cp;
typedef vector<int> vi;
inline void YN(bool x){puts(x ? "Yes" : "No");}
}
const int N = 55555, INF = 0x3f3f3f3f;
struct dinic
{
	struct Node
	{
		int u, v, w, c;
		Node() = default;
		Node(int u, int v, int w, int c) : u(u), v(v), w(w), c(c){}
	};
	vector<Node> e;
	vector<int> g[N];
	inline void clear(int n){e.clear(); do g[n].clear(); while (n--);}
	inline void addedge(int u, int v, int w, int c)
	{
		int s = e.size();
		e.emplace_back(Node(u, v, w, c)); g[u].emplace_back(s++); 
		e.emplace_back(Node(v, u, 0, -c)); g[v].emplace_back(s++); 
	}
	bool vis[N];
	int dist[N];
	inline bool spfa(int s, int t)
	{
		memset(dist, 0x3f, sizeof dist);
		queue<int> q; dist[s] = 0; vis[s] = true; q.push(s);
		while (!q.empty())
		{
			int u = q.front(); q.pop(); vis[u] = false;
			for (int f : g[u])
			{
				int v = e[f].v, w = e[f].w, c = e[f].c;
				if (w && (dist[u] + c < dist[v]))
				{
					dist[v] = dist[u] + c;
					if (!vis[v]){vis[v] = true; q.push(v);}
				}
			}
		}
		return dist[t] != INF;
	}
	int dfs(int u, int t, int flow, int& cost)
	{
		if (u == t) return flow;
		vis[u] = true;
		int rest = flow;
		for (int f : g[u])
		{
			int v = e[f].v, w = e[f].w, c = e[f].c;
			if (!vis[v] && w && (dist[v] == dist[u] + c))
			{
				int k = dfs(v, t, min(rest, w), cost);
				if (!k) dist[v] = -1;
				e[f].w -= k; e[f^1].w += k; rest -= k; cost += c * k;
			}
			if (!rest) break;
		}
		vis[u] = false;
		return flow - rest;
	}
	inline pii flow(int s, int t)
	{
		int flow, maxflow = 0, mincost = 0;
		while (spfa(s, t))
			while (flow = dfs(s, t, INF, mincost)) maxflow += flow;
		return make_pair(maxflow, mincost);
	}
}F;
int n, m, sum[N];
int main()
{
	scanf("%d%d", &n, &m);
	int ans = 0, s = 0, t = n + 1;
	for (int i=0, u, v, w; i<m; i++)
	{
		scanf("%d%d%d", &u, &v, &w);
		F.addedge(v, u, w, 1); sum[v] += w; sum[u] -= w; ans += w;
	}
	for (int i=1; i<=n; i++)
	{
		if (sum[i] > 0) F.addedge(s, i, sum[i], 0);
		else F.addedge(i, t, -sum[i], 0);
	}
	printf("%d\n", ans - F.flow(s, t).second);
	return 0;
}