#include <stdio.h>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <stdio.h>
#include <iostream>
#include <algorithm>
#include <deque>
#include <string.h>

using namespace std;

typedef pair<int, int> PII;

#ifdef _WIN32
#define TYPEOF decltype
#else
#define TYPEOF typeof
#endif

#define FOR(i,s,e) for(int i = s;i < e; i++)
#define TR(i, c) for(TYPEOF(c.begin()) i = c.begin(); i != c.end(); ++i)
#define TRS(i, c, ...) TR(__itr, c) { TYPEOF(*c.begin()) &i = *__itr;  __VA_ARGS__ }
#define TRP(f, s, c, ...) TR(__itr, c) { TYPEOF(c.begin()->first) &f = __itr->first; TYPEOF(c.begin()->second) &s = __itr->second;  __VA_ARGS__ }

#define NMAX 1024

int C[NMAX][NMAX];
int F[NMAX][NMAX];
int P[NMAX];
int Q[NMAX];
int viz[NMAX];

vector<int> G[NMAX];

int N,M;

int bfs() {

	int s = 0, e = 1;
	Q[0] = 1;
	memset(viz, 0, (N+1) * sizeof(int));
	viz[1] = 1;

	while(s < e) {
		int na = Q[s++];
		FOR(i,0,G[na].size()) {
			int nb = G[na][i];
			if(viz[nb] || C[na][nb] == F[na][nb]) continue;
			viz[nb] = 1;
			P[nb] = na;
			if(nb == N) return 1;
			Q[e++] = nb;
		}
	}

	return 0;
}

#define INF 0x3f3f3f3f

int main()
{
#if 1
	freopen("maxflow.in", "r", stdin);
#ifndef MY_STUFF
	freopen("maxflow.out", "w", stdout);
#endif
#endif

	scanf("%d %d", &N, &M);

	FOR(i,0,M) {
		int x,y,c;
		scanf("%d %d %d", &x, &y, &c);
		C[x][y] = c;
		G[x].push_back(y);
		G[y].push_back(x);
	}

	int flow, fmin;

	for(flow = 0; bfs(); flow += fmin)
	{
		fmin = INF;
		for(int nod = N; nod != 1; nod = P[nod])
			fmin = min(fmin, C[ P[nod] ][nod] - F[ P[nod] ][nod]);
		for(int nod = N; nod != 1; nod = P[nod]) {
			F[ P[nod] ][nod] += fmin;
			F[nod][ P[nod] ] -= fmin;
		}
	}

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

	return 0;
}