#include<cstdio>
#include <vector>
#include<queue>

using namespace std;
 
int n, m;
int c[1111][1111], leflux[1111][1111], tacsu[1111], viz[1111];
vector <int> muchii[1111];
queue <int> q;

int rezmin(int a, int b)
{
	if(a < b)
		return a;
	return b;
}

int main() 
{
  freopen("maxflow.in", "r", stdin);
	freopen("maxflow.out", "w", stdout);
	int i, x, y, z, rez, min, g = 1, nc, nn;
	scanf("%d%d", &n, &m);
	for (i = 1; i <= m; ++ i) 
	{
		scanf("%d%d", &x, &y, &z);
		muchii[x].push_back(y);
		muchii[y].push_back(x);
		c[x][y] = z;
	}
	for(i = 1; i <= n; ++ i)
		viz[i] = 0;
	q.push(1);
	viz[1] = 1;
	while(! q.empty())
	{
		nc = q.front();
		for (i = 0; i < muchii[nc].size(); ++ i)
		{
			nn = muchii[nc][i];
			if(viz[nn] == 0 && c[nc][nn] != leflux[nc][nn])
			{
				viz[nn] = 1;
				tacsu[nn] = nc;
				q.push(nc);
			}
		}
    q.pop();
	}
	if(viz[n] == 0)
		g = 0;
	while(g)
	{
		min = 111000000;
		for(i = n; i != 1; i = tacsu[i])
			min = rezmin(min, c[tacsu[i]][i] - leflux[tacsu[i]][i]);
		rez += min;
		for(i = n; i != 1; i = tacsu[i]) 
		{
			leflux[tacsu[i]][i] += min;
			leflux[i][tacsu[i]] -= min;
		}
		for(i = 1; i <= n; ++ i)
			viz[i] = 0;
		q.push(1);
		viz[1] = 1;
		while(! q.empty())
		{
			nc = q.front();
			for (i = 0; i < muchii[nc].size(); ++ i)
			{
				nn = muchii[nc][i];
				if(viz[nn] == 0 && c[nc][nn] != leflux[nc][nn])
				{
					viz[nn] = 1;
					tacsu[nn] = nc;
					q.push(nc);
				}
			}
			q.pop();
		}
		if(viz[n] == 0)
			g = 0;
	}
	printf("%d", rez);
	return 0;
}