#include <fstream>
#include <vector>
#include <algorithm>
#include <queue>
#include <iostream>
using namespace std;

#define in "maxflow.in"
#define out "maxflow.out"
#define N 1005
#define f(x,y) C[x][y]
#define oo 1 << 30
#define S 1
#define D n

typedef unsigned u;

vector <int> graf[N];
queue <int> Q;
int C[N][N], sol;
short n, m;
vector <short> tata (N, 0);

void BFS () {
	Q.push (S);
	while (Q.size()) {
		int x = Q.front();
		Q.pop();
		for (int i = graf[x].size() - 1; i >= 0; --i)
			if (graf[x][i] != S && !tata[graf[x][i]] && f (x, graf[x][i]) > 0) {
				Q.push (graf[x][i]);
				tata[graf[x][i]] = x;
			}
	}
}

int main () {
	ifstream fin (in);
	fin >> n >> m;
	for (int i = 0; i < m; ++i) {
		int x, y, c;
		fin >> x >> y >> c;
		f (x, y) = c;
		graf[x].push_back (y);
	}
	fin.close();
	do {
		for (int i = 1; i <= n; ++i)
			tata[i] = 0;
		BFS ();
		if (!tata[D]) //Nu exista arce nesaturate
			break;
		short x = D; 
		int MIN = oo;
		while (tata[x]) { //Determinarea fluxului maxim din lantul de ameliorare 
			MIN = min (MIN, f(tata[x], x));
			x = tata[x];
		}
		sol += MIN;
		x = D;
		while (tata[x]) { //Ameliorarea fluxului pe acest drum
			f(tata[x], x) -= MIN;
			x = tata[x];
		}
	} while (1);
	ofstream fout (out);
	fout << sol;
	fout.close();
	return 0;
}