#include<stdio.h>
#include<vector>
#define nmax 1024
#define oo 0x3f3f3f3f
using namespace std;

int n,m,C[nmax][nmax],viz[nmax],flow,fmin,x,y,z,tata[nmax],F[nmax][nmax],i;
int Q[nmax];
vector<int> G[nmax];


inline int bfs()
{
	int x,i,j,p;

	memset(viz,0,sizeof(viz));
	Q[0]=1;
	Q[1]=1;
	viz[1]=1;
	for(j=1;j<=Q[0];++j)
	{
		x=Q[j];
		if(x==n) continue;
		for(i=0;i<G[x].size();i++)
				{
					p=G[x][i];
					if(!viz[p]&&C[x][p]-F[x][p]>0)
					{
					Q[++Q[0]]=p;
					tata[p]=x;
					viz[p]=1;}
				}
	}
	return viz[n];
}

int main()
{
	int p,j;
	freopen("maxflow.in","r",stdin);
	freopen("maxflow.out","w",stdout);
	scanf("%d %d",&n,&m);
	for(i=1;i<=m;i++)
	{
		scanf("%d %d %d",&x,&y,&z);
		G[x].push_back(y);
		G[y].push_back(x);
		C[x][y]=z;
	}
	
	flow=0;
	while(bfs())
	   for(j=0; j < G[n].size() ;j++)
		{p=G[n][j];
		if (F[p][n] == C[p][n] || !viz[p]) continue;
		tata[n]=p;
		
		fmin=oo;
		for(i=n;i!=1;i=tata[i])
		{
			fmin=min(fmin, C[tata[i]][i]-F[tata[i]][i]);
		}
		if (fmin == 0) continue;
		
		for(i=n;i!=1;i=tata[i])
		{
			F[tata[i]][i]+=fmin;
			F[i][tata[i]]-=fmin;
		}
		
		flow+=fmin;
	}

	printf("%d\n",flow);
	
	return 0;
}