#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;

const int MAX_N = 1010;
const int INF = 0x3f3f3f3f;

int n, m, sol;
int c[MAX_N][MAX_N];
int f[MAX_N], q[MAX_N], up[MAX_N];

int bf()
{
	memset(f, 0, sizeof(f));
	memset(q, 0, sizeof(q));
	memset(up, 0, sizeof(up));

	f[1] = INF;
	q[0] = 1;
	int l, r, i;

	for (l = r = 0; l <= r; ++l)
	{
		int nod = q[l];

		for (i = 1; i <= n; ++i)
			if (c[nod][i] && !f[i])
			{
				f[i] = min(f[nod], c[nod][i]);
				up[i] = nod;
				q[++r] = i;
			}
	}

	if (!f[n]) return 0;

	sol += f[n];

	for (i = n; i != 1; i = up[i])
	{
		c[up[i]][i] -= f[n];
		c[i][up[i]] += f[n];
	}

	return 1;
}

int main()
{
	int i, x, y, z;
	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, &z);
		c[x][y] = z;
	}

	int c = 1;
	while (c) c = bf();

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