#include <iostream>
#include <fstream>
#include <vector>
#include <queue>

using namespace std;

ifstream fin("maxflow.in");
ofstream fout("maxflow.out");

const int NMAX = 1005;

int n, m, total;
vector<vector<int>> la; 	// lista de adiacenta
int flux[NMAX][NMAX];
bool vizitat[NMAX];
int pred[NMAX];

bool bfs() {
	queue<int> coada;

	for (int i = 1; i <= n; i++) {
		pred[i] = 0;
		vizitat[i] = 0;
	}

	vizitat[1] = true;
	coada.push(1);

	while (!coada.empty()) {
		int nod = coada.front();
		coada.pop();
		for (auto& vecin : la[nod]) {
			if (!vizitat[vecin] && flux[nod][vecin] > 0) {
				pred[vecin] = nod;
				coada.push(vecin);
				vizitat[vecin] = true;

				if (vecin == n)
					return 1;
			}
		}
	}
	return 0;
}

int main() {
	
	fin >> n >> m;
	la.resize(n + 1);

	for (int i = 1; i <= m; i++) {
		int x, y, z;
		fin >> x >> y >> z;

		la[x].push_back(y);
		la[y].push_back(x);
		flux[x][y] = z;
	}

	while (bfs()) {
		for (auto& nod : la[n]) {
			if (!vizitat[nod])
				continue;
			
			int minim = INT32_MAX;

			int aux = n;
			while (aux != 1) {
				minim = min(minim, flux[pred[aux]][aux]);
				aux = pred[aux];
			}

			aux = n;
			while (aux != 1) {
				flux[pred[aux]][aux] -= minim;
				flux[aux][pred[aux]] += minim;
				aux = pred[aux];
			}

			total = total + minim;
		}
	}

	cout << total;

	return 0;
}