#include <cstdio>
#include <vector>
#include <cstring>
#include <queue>
#define INF 0x3f3f3f3f

using namespace std;

const int MAXN = 1005;
int N, M, C[MAXN][MAXN], F[MAXN][MAXN], TT[MAXN], cd[MAXN];
vector <int> G[MAXN];
bool Used[MAXN];

int BFS()
{
	int i, j, node, V;
	memset(Used, 0, sizeof(Used));
	cd[0] = 1;
	cd[1] = 1;
	Used[1] = 1;
	for (int i = 1; i <= cd[0]; ++i)
	{
		node = cd[i];
		if (node == N) continue;
		for (int j = 0; j < G[node].size(); ++j)
		{
			V = G[node][j];
			if (C[node][V] == F[node][V] || Used[V]) continue;
			Used[V] = 1;
			cd[++cd[0]] = V;
			TT[V] = node;
		}
	}
	return Used[N];
}

int main()
{
	freopen("maxflow.in",  "r", stdin);
	freopen("maxflow.out", "w", stdout);
	int i, flow, fmin, node, x, y, z;
	scanf("%d %d", &N, &M);
	for (int i = 1; i <= M; ++i)
	{
		scanf("%d %d %d", &x, &y, &z);
		G[x].push_back(y);
		G[y].push_back(x);
		C[x][y] += z;
	}
	for (flow = 0; BFS(); )
	{
		for (i = 0; i < G[N].size(); ++i)
		{
			node = G[N][i];
			if (F[node][N] == C[node][N] || !Used[node]) continue;
			TT[N] = node;
			fmin = INF;
			for (node = N; node != 1; node = TT[node])
				fmin = min(fmin, C[TT[node]][node] - F[TT[node]][node]);
			if (fmin == 0) continue;
			for (node = N; node != 1; node = TT[node])
			{
				F[TT[node]][node] += fmin;
				F[node][TT[node]] -= fmin;
			}
			flow += fmin;
		}
	}
	printf("%d\n", flow);
	return 0;
}