#include<cstdio>
#include<algorithm>
#include<deque>
#include<vector>
#include<cstring>
#include<climits>
using namespace std;
int m,n,i,j,k,x,y,rez,minflow,tata[1005];
int flux[1005][1005];
vector<int>v[1005];
deque<int>c;
bool viz[1005];

bool Bf(int x)
{
	memset(viz,false,sizeof(viz));
	viz[x]=true;
	while (!c.empty()) c.pop_front();
	c.push_back(x);
	while (!c.empty())
	{
		x=c.front();
		if (x==n) return true;
		for (j=0;j<v[x].size();j++)
		{
			if (!viz[v[x][j]] && flux[x][v[x][j]])
					{
						if (v[x][j]==n) { viz[n]=true;continue;}
						viz[v[x][j]]=true;
						tata[v[x][j]]=x;
						c.push_back(v[x][j]);
			}
		}
		c.pop_front();
	}
	return viz[n]>0;
}
int main()
{
	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,&k),v[x].push_back(y),v[y].push_back(x),flux[x][y]=k;
	while (Bf(1))
	{
		for (int j=0;j<v[n].size();j++)
			{
				tata[n]=v[n][j];
				minflow=LONG_MAX;
				for (i=n;i!=1;i=tata[i])
					minflow=min(minflow,flux[tata[i]][i]);
				if (minflow>0)
				{
					for (int i=n;i!=1;i=tata[i])
						flux[tata[i]][i]-=minflow,flux[i][tata[i]]+=minflow;
					rez=rez+minflow;
				}
		}
	}
	printf("%d\n",rez);
	return 0;
}