#include<stdio.h>
#include<vector>
using namespace std;
FILE*f=fopen("maxflow.in","r");
FILE*g=fopen("maxflow.out","w");
int ok,n,m,x,y,z,nod,sol,minn,F[1001][1001],c[1001][1001],t[1001],viz[1001];
vector <int> v[1001];
int dfs (int nod)
{
	viz[nod]=1;
	
	for(int i=0;i<v[nod].size();++i)
		if(!viz[v[nod][i]]&&c[nod][v[nod][i]]-F[nod][v[nod][i]]>0)
		{
			t[v[nod][i]]=nod;
			if(v[nod][i]!=n)
				dfs(v[nod][i]);
			else
				ok=1;
		}
		
	return ok;
}
int main()
{
	fscanf(f,"%d%d",&n,&m);
	for(int i=1;i<=m;++i)
	{
		fscanf(f,"%d%d%d",&x,&y,&z);
		v[x].push_back (y);
		v[y].push_back (x);
		c[x][y]=z;
	}
	
	while(dfs(1))
	{
		for(int i=0;i<v[n].size();++i)
		{
			nod=v[n][i];
			minn=c[v[n][i]][n]-F[v[n][i]][n];
			for(;nod!=1;nod=t[nod])
				if(c[t[nod]][nod]-F[t[nod]][nod]<minn)
					minn=c[t[nod]][nod]-F[t[nod]][nod];
			F[v[n][i]][n]+=minn;
			F[n][v[n][i]]-=minn;
			for(nod=v[n][i];nod!=1;nod=t[nod])
			{
				F[t[nod]][nod]+=minn;
				F[nod][t[nod]]-=minn;
			}
			
			sol+=minn;
		}	
		ok=0;
		for(int i=1;i<=n;++i)
			viz[i]=0;
	}
	
	fprintf(g,"%d",sol);
	
	fclose(f);
	fclose(g);
	return 0;
}