#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,sse4.1,sse4.2,popcnt,abm,mmx,avx")
// #pragma comment(linker, "/stack:200000000"]

#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <unordered_set>
#include <unordered_map>
#include <set>
#include <map>
#include <queue>
#include <deque>
#include <bitset>
#include <stack>
#include <random>
#include <fstream>
#include <sstream>
#include <chrono>

#define fi first
#define se second
#define pb push_back
#define ll long long
#define ld long double
#define hm unordered_map
#define pii pair<int, int>
#define sz(a) (int)a.size()
#define all(a) a.begin(), a.end()
#define cinv(v) for (auto& x: v) cin >> x
#define fr(i, n) for (int i = 0; i < n; ++i)
#define fl(i, l, n) for (int i = l; i < n; ++i)

#define int ll

using namespace std;

#ifdef __LOCAL
	#define dbg(x) cerr << #x << " : " << x << '\n'
	const int maxn = 20;
#else
	#define dbg(x)
	const int maxn = 500 + 20;
#endif

//tg: @galebickosikasa

const ll inf = (ll) 2e9;
const ld pi = asin (1) * 2;
const ld eps = 1e-8;
const ll mod = (ll)1e9 + 7;
const ll ns = 97;

mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());

struct edge {
	int to, c, f;
};

vector<edge> edges;
vector<int> g[maxn];
int it[maxn], d[maxn];

int bfs (int n, int x) {
	for (auto& x: d) x = inf;
	d[0] = 0;
	queue<int> a;
	a.push (0);
	while (!a.empty ()) {
		int v = a.front ();
		a.pop ();
		for (auto& u: g[v]) {
			auto& e = edges[u];
			if (d[e.to] == inf && e.c - e.f >= x) {
				d[e.to] = d[v] + 1;
				a.push (e.to);
			}
		}
	}
	return d[n - 1] < inf;
}

int dfs (int v, int t, int x, int c = inf, int p = -1) {
	if (v == t) return c;
	while (it[v] < sz (g[v])) {
		auto& e = edges[g[v][it[v]]];
		if (e.to == p || e.c - e.f < x || d[v] + 1 != d[e.to]) {
			++it[v];
			continue;
		}
		int delta = dfs (e.to, t, x, min (c, e.c - e.f), v);
		if (delta > 0) {
			auto& _e = edges[g[v][it[v]]^1];
			e.f += delta;
			_e.f -= delta;
			return delta;
		}
		++it[v];
	}
	return 0;
}

signed main () {
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);
	cout.tie(nullptr);
	int n, m;
	cin >> n >> m;
	fr (i, m) {
		int a, b, c;
		cin >> a >> b >> c;
		--a, --b;
		g[a].pb (sz (edges));
		edges.pb ({b, c, 0});
		g[b].pb (sz (edges));
		edges.pb ({a, 0, 0});
	}
	for (int x = 30; x >= 0; --x) {
		while (bfs (n, (1<<x))) {
			while (dfs (0, n - 1, (1<<x))) {}
			for (auto& y: it) y = 0;
		}
	}
	int f = 0;
	for (auto& x: g[0]) {
		auto& e = edges[x];
		f += e.f;
	}
	cout << f << '\n';









}