#include <bits/stdc++.h>
#define NMAX 1005
#define INF 0x3f3f3f3f
using namespace std;
ifstream fin("maxflow.in");
ofstream fout("maxflow.out");
void read();
int s, t;
int n, m, flow;
bool viz[NMAX];
vector<int> v[NMAX];
int c[NMAX][NMAX], f[NMAX][NMAX];
int p[NMAX];
int bfs()
{
	for (int i = 1; i <= n; i++)
		p[i] = 0;
	queue<int> q;
	p[s] = s;
	q.push(s);
	while (!q.empty())
	{
		int nod = q.front();
		q.pop();
		for (auto it : v[nod])
			if (!p[it] && c[nod][it] - f[nod][it] > 0)
			{
				p[it] = nod;
				if (it != t)
					q.push(it);
			}
	}
	if (p[t])
		return 1;
	return 0;
}
int main()
{
	read();
	while (bfs())
	{
		int flow_path;
		for (auto it : v[t])
			if (c[it][t] - f[it][t] > 0 && p[it])
			{
				p[t] = it;
				flow_path = INF;
				for (int nod = t; nod != s; nod = p[nod])
					flow_path = min(flow_path, c[p[nod]][nod] - f[p[nod]][nod]);
				if (flow_path)
					for (int nod = t; nod != s; nod = p[nod])
					{
						f[p[nod]][nod] += flow_path;
						f[nod][p[nod]] -= flow_path;
					}
				flow += flow_path;
			}
	}
	fout << flow;
	return 0;
}
void read()
{
	fin >> n >> m;
	s = 1;
	t = n;
	for (int i = 1; i <= m; i++)
	{
		int x, y, cap;
		fin >> x >> y >> cap;
		v[x].push_back(y);
		v[y].push_back(x);
		c[x][y] = cap;
	}
}