#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cctype>
#include <cmath>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <stack>
#include <cassert>
using namespace std;

#define PRO "maxflow"
void OpenFiles(int EVAL)
{
	if(EVAL)
	{
		char input[100] = PRO, output[100] = PRO;
		freopen(strcat(input, ".in"),"r",stdin);
		freopen(strcat(output,".out"),"w",stdout);
	} else
	{
		freopen("test.in","r",stdin);
		freopen("test.out","w",stdout);
	}
}

#define MAX  1001
#define INF 0xffffff
#define EPS 1E-8

int n,c[MAX][MAX],f[MAX][MAX],tt[MAX],q[MAX];
vector<int>g[MAX];
bool viz[MAX];

bool bfs()
{
	memset(viz,0,sizeof(viz));
	int p,u,x,y;
	q[p=u=1]=1;
	while(p<=u)
	{
		x=q[p++];
		if(x==n)continue;
		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;
				q[++u]=y;
				tt[y]=x;
			}
		}
	}
	return viz[n];
}

void maxflow()
{
	int fm = 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]);
			if(flux!=0)
			for(int x=n;x!=1;x=tt[x])
			{
				f[tt[x]][x]+=flux;
				f[x][tt[x]]-=flux;
			}
			fm += flux;
		}
	}
	printf("%d\n",fm);
}

int main(int argv,char *args[])
{
	OpenFiles(argv==0);
	// start
	int m,x,y,z;
		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;
}