#include <cstdio>
#include <vector>
using namespace std;

#define NMAX 1050 
#define inf 2147000000

long graf[NMAX][NMAX], flux[NMAX][NMAX];

struct lol
{
	long nod, tata, minim;
};
lol queue[NMAX];

long v[NMAX], viz, n, m, a, b, c, rez, este_drum, minmin;

void BFS()
{
	++viz;
	long beg = 1, end = 1;
	queue[beg].nod = 1;
	queue[beg].tata = -1;
	queue[beg].minim = inf;
	v[1] = viz;

	while (beg <= end)
	{
		long nod = queue[beg].nod;
		for (long j = 1; j <= n; ++j)
		{
			if (graf[nod][j])
			{
				long reziduu = graf[nod][j] - flux[nod][j];
				if (v[j] != viz && reziduu)
				{
					++end;
					v[j] = viz;
					queue[end].nod = j;
					queue[end].tata = beg;
					queue[end].minim = reziduu < queue[beg].minim ? reziduu : queue[beg].minim;
					if (j == n)
					{
						beg = inf - 1;
						break;
					}
				}
			}
		}
		++beg;
	}
	
	minmin = queue[end].minim;
	if (beg == inf)
	{
		este_drum = 1;
		while (queue[end].tata != -1)
		{
			flux[queue[queue[end].tata].nod][queue[end].nod] += minmin;
			flux[queue[end].nod][queue[queue[end].tata].nod] -= minmin;
			end = queue[end].tata;
		}
	}
	else
	{
		este_drum = 0;
	}
}

int main()
{
	freopen ("maxflow.in", "rt", stdin);
	freopen ("maxflow.out", "wt", stdout);

	scanf("%ld %ld", &n, &m);

	for (long i = 0; i < m; ++i)
	{
		scanf("%ld %ld %ld", &a, &b, &c);
		graf[a][b] = c; //graf[b][a] = c;
	}

	este_drum = 1;
	while (este_drum)
	{
		este_drum = 0;
		BFS();
	}


	for (long i = 1; i <= n; ++i)
		rez += flux[1][i];

	printf("%ld\n", rez);

	return 0;
}