#include <stdio.h>
#include <string.h>
#include <vector>

using namespace std;

vector<int> v[1024];
int c[1024][1024], f[1024][1024];
int n, m;

int flux();

int main()
{
	freopen("maxflow.in", "r", stdin);
	freopen("maxflow.out", "w", stdout);

	int x, y, i, sol = 0, temp, cap;

	scanf("%d %d", &n, &m);
	for(i = 1; i <= m; ++i)
	{
		scanf("%d %d %d",  &x, &y, &cap);
		v[x].push_back(y);
		v[y].push_back(x);
		c[x][y] = cap;
	}
	while((temp = flux()))
	{
		sol += temp;
	}

	printf("%d\n", sol);

	return 0;
}

int flux()
{
	int q[1024], prev[1024], first, last, nod, flow = 111000;;

	q[first = last = 1] = 1;
	memset(prev, 0, sizeof(prev));
	prev[1] = -1;

	while(first <= last)
	{
		nod = q[first];
		int sz = v[nod].size();
		for(int i = 0; i < sz; ++i)
		{
			if(!prev[v[nod][i]] && c[nod][v[nod][i]] - f[nod][v[nod][i]] > 0)
			{
				q[++last] = v[nod][i];
				prev[v[nod][i]] = nod;
				if(v[nod][i] == n)
					 break;
			}
		}
		++first;
	}
	nod = n;
	while(prev[nod] > 0)
	{
		if(c[prev[nod]][nod] - f[prev[nod]][nod]< flow)
		{
			flow = c[prev[nod]][nod] - f[prev[nod]][nod];
		}
		nod = prev[nod];
	//	printf("%d\n", nod);
	}
	nod = n;
	while(prev[nod] > 0)
	{
		f[prev[nod]][nod] += flow;
		f[nod][prev[nod]] -= flow;
		nod = prev[nod];
	}

	if(flow == 111000)
		return 0;
	return flow;
}