#include<bits/stdc++.h>
using namespace std;
int u[20020],v[20020],w[20020],c[20020],tot,deg[2020];
vector<int> G[2020];
void addEdge(int from,int to,int capacity,int cost)
{
	u[tot]=from;
	v[tot]=to;
	w[tot]=capacity;
	c[tot]=cost;
	G[from].push_back(tot++);
	u[tot]=to;
	v[tot]=from;
	w[tot]=0;
	c[tot]=-cost;
	G[to].push_back(tot++);
}
int dist[2020],head[2020];
bool inque[2020],vis[2020];
int cost;
bool spfa(int s,int t)
{
	memset(dist,0x3f,sizeof(dist));
	memset(inque,0,sizeof(inque));
	dist[s]=0;
	inque[s]=1;
	queue<int> q;
	q.push(s);
	while(!q.empty())
	{
		int x=q.front();
		q.pop();
		inque[x]=0;
		for(auto e:G[x])
			if(dist[x]+c[e]<dist[v[e]]&&w[e])
			{
				dist[v[e]]=dist[x]+c[e];
				if(!inque[v[e]])
				{
					inque[v[e]]=1;
					q.push(v[e]);
				}
			}
	}
	return (dist[t]!=0x3f3f3f3f);
}
int dfs(int u,int t,int flow)
{
	if(u==t) return flow;
	vis[u]=1;
	int ret=0;
	for(;head[u]<G[u].size()&&flow;head[u]++)
	{
		int e=G[u][head[u]];
		if(!vis[v[e]]&&dist[v[e]]==dist[u]+c[e]&&w[e])
		{
			int aug=dfs(v[e],t,min(flow,w[e]));
			flow-=aug;
			ret+=aug;
			w[e]-=aug;
			w[e^1]+=aug;
			cost+=c[e]*aug;
			if(!flow)
			{
				vis[u]=0;
				return ret;
			}
		}
	}
	vis[u]=0;
	return ret;
}
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int n,m;
	cin>>n>>m;
	int sum=0;
	for(int i=1;i<=m;i++)
	{
		int u,v,w;
		cin>>u>>v>>w;
		sum+=w;
		deg[u]+=w;
		deg[v]-=w;
		addEdge(u,v,w,1);
	}
	for(int i=1;i<=n;i++)
		if(deg[i]>0)
			addEdge(0,i,deg[i],0);
		else
			addEdge(i,n+1,-deg[i],0);
	while(spfa(0,n+1))
	{
		memset(head,0,sizeof(head));
		while(dfs(0,n+1,0x3f3f3f3f));
	}
	cout<<sum-cost<<endl;
	return 0;
}