#include <vector>
#include <string> 
#include <set> 
#include <map> 
#include <queue> 
#include <bitset> 
#include <stack>
#include <list>

#include <numeric> 
#include <algorithm> 

#include <cstdio>
#include <fstream>
#include <iostream> 
#include <sstream> 
#include <iomanip>

#include <cctype>
#include <cmath> 
#include <ctime>
#include <cassert>

using namespace std;

#define LL long long
#define PII pair <int, int>
#define VB vector <bool>
#define VI vector <int>
#define VD vector <double>
#define VS vector <string>
#define VPII vector <pair <int, int> >
#define VVI vector < VI >
#define VVB vector < VB >

#define FORN(i, n) for(int i = 0; i < (n); ++i)
#define FOR(i, a, b) for(int i = (a); i <= (b); ++i)
#define FORD(i, a, b) for(int i = (a); i >= (b); --i)
#define FORI(it, X) for(__typeof((X).begin()) it = (X).begin(); it !=(X).end(); ++it) 
#define REPEAT do{ 
#define UNTIL(x) }while(!(x)); 

#define SZ size()
#define BG begin() 
#define EN end() 
#define CL clear()
#define X first
#define Y second
#define RS resize
#define PB push_back
#define MP make_pair
#define ALL(x) x.begin(), x.end()

#define IN_FILE "maxflow.in"
#define OUT_FILE "maxflow.out"

int n, m;
VVI c, f, g, gt;
queue<int> fifo;
VI x, h, current1, current2;

void push(int u, int v, int kap)
{
	if (x[v] == 0 && kap > 0 && v != 1 && v != n) fifo.push(v);
	else 
		if (x[u] == 0 && kap < 0 && u != 1 && u != n) fifo.push(u);
	f[u][v] += kap;
	x[u] -= kap;
	x[v] += kap;
}

void relabel(int node)
{
	int mm = n * n;
	FOR(i, 1, n)
		if ((c[node][i] > f[node][i]) || (f[i][node] > 0)) mm = min(mm, h[i]);
	h[node] = mm + 1;
}

int main()
{
	freopen(IN_FILE, "r", stdin);
	freopen(OUT_FILE, "w", stdout);

	cin >> n >> m;
	c.RS(n + 1, VI(n + 1));
	f.RS(n + 1, VI(n + 1));
	x.RS(n + 1);
	h.RS(n + 1);
	g.RS(n + 1);
	gt.RS(n + 1);
	current1.RS(n + 1);
	current2.RS(n + 1);
	FOR(i, 1, m)
	{
		int xx, yy, zz;
		cin >> xx >> yy >> zz;
		c[xx][yy] = zz;
		g[xx].PB(yy);
		gt[yy].PB(xx);
	}

	h[1] = n;
	FOR(i, 1, n) 
	{
		f[1][i] = c[1][i];
		x[i] += f[1][i];
		if (f[1][i]) fifo.push(i);
	}

	while (!fifo.empty())
	{
		int node = fifo.front();
		fifo.pop();
		while (x[node])
		{
			int i = current1[node];
			while (i < g[node].SZ)
			{
				int next = g[node][i];
				if (h[node] == (h[next] + 1))
				{
					if (c[node][next] > f[node][next]) 
					{
						int aux = min(x[node], c[node][next] - f[node][next]);
						push(node, next, aux);
						if (!x[node]) break;
					}
				}
				++i;
			}
			current1[node] = i;
			if (x[node])
			{
				i = current2[node];
				while (i < gt[node].SZ)
				{
					int next = gt[node][i];
					if (h[node] == (h[next] + 1))
					{
						if (f[next][node]) 
						{
							int aux = min(x[node], f[next][node]);
							push(next, node, -aux);
							if (!x[node]) break;
						}
					}
					++i;
				}
				current2[node] = i;
			}
				
			if (x[node]) 
			{
				relabel(node);
				current1[node] = 0;
				current2[node] = 0;
			}
		}
	}

	cout << x[n];

	return 0;
}