#include <bits/stdc++.h>
using std::cin;
using std::cout;
using std::bitset;
using std::complex;
using std::vector;
using std::array;
using std::list;
using std::string;
using std::pair;
using std::queue;
using std::priority_queue;
using std::set;
using std::map;
using std::unordered_map;
using std::sort;
using std::min;
using std::max;
using std::reverse;
using std::min_element;
using std::max_element;
using std::accumulate;

using vi = vector<int>; using vvi = vector<vi>; using vvvi = vector<vvi>;
using ll = long long int;
using vll = vector<ll>; using vvll = vector<vll>; using vvvll = vector<vvll>;
using vd = vector<double>; using vvd = vector<vd>; using vvvd = vector<vvd>;
using P = pair<int, int>;
using Pll = pair<ll, ll>;
using cdouble = complex<double>;

const double eps = 1e-7;
#define Loop(i, n) for(int i = 0; i < int(n); i++)
#define Loopll(i, n) for(ll i = 0; i < ll(n); i++)
#define Loop1(i, n) for(int i = 1; i <= int(n); i++)
#define Loopll1(i, n) for(ll i = 1; i <= ll(n); i++)
#define Loopr(i, n) for(int i = int(n) - 1; i >= 0; i--)
#define Looprll(i, n) for(ll i = ll(n) - 1; i >= 0; i--)
#define Loopr1(i, n) for(int i = int(n); i >= 1; i--)
#define Looprll1(i, n) for(ll i = ll(n); i >= 1; i--)
#define Foreach(buf, container) for(const auto &buf : container)
#define Foreachr(buf, container)  for(const auto &buf : reversed(container))
#define Loopdiag(i, j, h, w, sum) for(int i = ((sum) >= (h) ? (h) - 1 : (sum)), j = (sum) - i; i >= 0 && j < (w); i--, j++)
#define Loopdiagr(i, j, h, w, sum) for(int j = ((sum) >= (w) ? (w) - 1 : (sum)), i = (sum) - j; j >= 0 && i < (h); j--, i++)
#define Loopdiagsym(i, j, h, w, gap) for (int i = ((gap) >= 0 ? (gap) : 0), j = i - (gap); i < (h) && j < (w); i++, j++)
#define Loopdiagsymr(i, j, h, w, gap) for (int i = ((gap) > (h) - (w) - 1 ? (h) - 1 : (w) - 1 + (gap)), j = i - (gap); i >= 0 && j >= 0; i--, j--)
#define Loopitr(itr, container) for(auto itr = container.begin(); itr != container.end(); itr++)
#define quickio() std::ios::sync_with_stdio(false); std::cin.tie(0);
#define bitmanip(m,val) static_cast<bitset<(int)m>>(val)
#define Comp(type_t) bool operator<(const type_t &another) const
#define fst first
#define snd second
#define INF INFINITY
bool feq(double x, double y) { return abs(x - y) <= eps; }
bool inrange(ll x, ll t) { return x >= 0 && x < t; }
bool inrange(vll xs, ll t) { Foreach(x, xs) if (!(x >= 0 && x < t)) return false; return true; }
int ceillog2(ll x) { int m = int(log2(x)); return m + ((1LL << m) < x ? 1 : 0); }
int floorlog2(ll x) { int m = int(log2(x)); return m - ((1LL << m) > x ? 1 : 0); }
const string endl = "\n";
template<class T> T reversed(T container) { reverse(container.begin(), container.end()); return container; }
template<class T> void printv(const vector<T> &v) { for (const T &x : v) cout << x << " "; cout << endl; }
template<class T> void printmx(const vector<vector<T>> &mx) { for (const vector<T> &v : mx) printv(v); }
ll rndf(double x) { return (ll)(x + (x >= 0 ? 0.5 : -0.5)); }
ll floorsqrt(ll x) { ll m = (ll)sqrt((double)x); return m + (m*  m <= x ? 0 : -1); }
ll ceilsqrt(ll x) { ll m = (ll)sqrt((double)x); return m + (x <= m * m ? 0 : 1); }
ll rnddiv(ll a, ll b) { return (a / b + (a % b * 2 >= b ? 1 : 0)); }
ll ceildiv(ll a, ll b) { return (a / b + (a % b == 0 ? 0 : 1)); }
ll gcd(ll m, ll n) { if (n == 0) return m; else return gcd(n, m % n); }
ll lcm(ll m, ll n) { return ll(m) * ll(n) / gcd(m, n); }

//========================================================================//

class MaxFlow {
private:
	struct edge_t {
		int from; int to; ll cap; edge_t* rev;
	};
	struct node_t {
		int skip = false;
		list<edge_t*> edges;
	};
	struct graph_t {
		int n, m;
		int s, t;
		vector<node_t> nodes;
	};
	void add_edge(int a, int b, ll c) {
		edge_t *e_pre;
		edge_t *e_rev;
		if (pre_edges[{a, b}] == nullptr) {
			e_pre = new edge_t({ a, b, c, nullptr });
			e_rev = new edge_t({ b, a, 0, nullptr });
			e_pre->rev = e_rev;
			e_rev->rev = e_pre;
			pre_edges[{a, b}] = e_pre;
			this->G.nodes[a].edges.push_back(e_pre);
			this->G.nodes[b].edges.push_back(e_rev);
		}
		else {
			pre_edges[{a, b}]->cap += c;
		}
	}
	void make_level_graph(int s, int t) {
		LG.n = G.n;
		LG.m = 0;
		LG.s = s;
		LG.t = t;
		LG.nodes = vector<node_t>(G.n);
		vi levels(G.n, INT_MAX);
		queue<int> que;
		levels[s] = 0;
		que.push(s);
		while (que.size()) {
			int a = que.front(); que.pop();
			for (edge_t* e : G.nodes[a].edges) {
				if (e->cap > 0) {
					if (levels[e->to] == INT_MAX) {
						levels[e->to] = levels[a] + 1;
						que.push(e->to);
					}
					if (levels[e->to] == levels[a] + 1) {
						LG.nodes[a].edges.push_back(e);
						LG.m += 1;
					}
				}
			}
		}
		if (levels[t] == INT_MAX) LG.t = -1;
	}
	ll add_flow_on_LG(int a, ll f) {
		if (a == LG.t) return f;
		ll ret = 0;
		for (auto itr = LG.nodes[a].edges.begin(); itr != LG.nodes[a].edges.end();) {
			if (f == 0) break;
			edge_t* e = *itr;
			if (LG.nodes[e->to].skip) {
				itr = LG.nodes[a].edges.erase(itr);
			}
			else {
				ll df = add_flow_on_LG(e->to, min(e->cap, f));
				if (df > 0) {
					e->cap -= df;
					e->rev->cap += df;
					ret += df;
					f -= df;
					if (e->cap == 0) itr = LG.nodes[a].edges.erase(itr);
					else itr++;
				}
				else {
					LG.nodes[e->to].skip = true;
					itr = LG.nodes[a].edges.erase(itr);
				}
			}
		}
		return ret;
	}
	// return achieved flow
	ll add_flow_sub(int s, int t, ll f) {
		ll ret = 0;
		Loop(_, G.n) {
			if (f == 0) break;
			make_level_graph(s, t);
			if (LG.t == -1) break;
			ll df = add_flow_on_LG(LG.s, f);
			if (df == 0) break;
			ret += df;
			f -= df;
		}
		return ret;
	}
	map<P, edge_t*> pre_edges;
	graph_t G, LG;
	ll sum_flow = 0;
public:
	MaxFlow(const vvi &lst, const vvll &cap, int s, int t) {
		this->G.n = lst.size();
		this->G.s = s;
		this->G.t = t;
		this->G.nodes = vector<node_t>(G.n);
		Loop(i, lst.size()) {
			Loop(k, lst[i].size()) {
				int j = lst[i][k];
				ll c = cap[i][k];
				add_edge(i, j, c);
			}
		}
	}
	~MaxFlow() {
		for (const auto &x : this->pre_edges) {
			edge_t *e = x.snd;
			delete e->rev;
			delete e;
		}
	}
	// return achieved flow, Dinic's algorithm, O(min(n^2 m, fm))
	void add_flow(ll f = LLONG_MAX) {
		this->sum_flow += add_flow_sub(this->G.s, this->G.t, f);
	}
	// make sure that the capacity of edge a->b is non-negative in the primal graph
	void add_cap(int a, int b, ll dcap, bool update_flag = true) {
		add_edge(a, b, dcap);
		edge_t *e = pre_edges[{a, b}];
		if (e->cap < 0) {
			int df = -(e->cap);
			add_flow_sub(a, G.s, df);
			add_flow_sub(G.t, b, df);
			e->cap += df;
			e->rev->cap -= df;
			this->sum_flow -= df;
		}
		if (update_flag) add_flow();
	}
	ll get_flow() {
		return this->sum_flow;
	}
};


int main() {
	quickio();
	int n, m, s, t;
	cin >> n >> m;
	s = 0;
	t = n - 1;
	vvi lst(n);
	vvll cap(n);
	Loop(_, m) {
		int i, j; cin >> i >> j;
		ll c; cin >> c;
		lst[i].push_back(j);
		cap[i].push_back(c);
	}
	MaxFlow *mf = new MaxFlow(lst, cap, s, t);
	mf->add_flow();
	cout << mf->get_flow() << endl;
}


Measured memory_bytes: 3432