#include <stdio.h>
#include <algorithm>
#include <cmath>
#include <cctype>
#include <cstring>
#include <vector>
#include <deque>
#include <queue>
#include <set>
using namespace std;
#define inf 0xffffff
#define Max 1001

vector<int>g[Max];

int n,m,c[Max][Max],f[Max][Max],q[Max],tt[Max];
bool viz[Max];

bool bfs()
{
	int p,u,x,y;
	q[p=u=1]=1;
		memset(viz,0,sizeof(viz));
	while(p<=u)
	{
		x=q[p++];
		for(int i=0;i<g[x].size();i++)
		{
			y=g[x][i];
			if(!viz[y] && c[x][y] > f[x][y])
			{
				viz[y]=1;
				tt[y]=x;
				if(y!=n)q[++u]=y;
			}
		}
	}
	return viz[n];
}

void maxflow()
{
	int flux_max=0,flux;
	while( bfs() )
	{
		for(int i=0;i<g[n].size();i++)
		{
			tt[n]=g[n][i];
			flux = inf;
			for(int x=n;x!=1;x=tt[x]) flux=min(flux,c[tt[x]][x]-f[tt[x]][x]);
			for(int x=n;x!=1;x=tt[x])
			{
				f[tt[x]][x]+=flux;
				f[x][tt[x]]-=flux;
			}
			flux_max+=flux;
		}
	}
	printf("%d\n",flux_max);
}

int main()
{
	int x,y,z;
	freopen("maxflow.in","r",stdin);
	freopen("maxflow.out","w",stdout);
		scanf("%d %d",&n,&m);
		for(int i=1;i<=m;i++)
		{
			scanf("%d %d %d",&x,&y,&z);
			c[x][y]=z;
			g[x].push_back(y);
			g[y].push_back(x);
		}
		maxflow();
	return 0;
}