#include <fstream>
#include <vector>
#include <cstring>
#define NMAX 1024;
#define inf 0x3f3f3f3f;
 
using namespace std;

ifstream fin("maxflow.in");
ofstream fout("maxflow.out");
 
int n, m, F[NMAX][NMAX], C[NMAX][NMAX], TT[NMAX], flow, fmin, Q[NMAX], x, y, z, V, viz[NMAX];
vector <int> v[NMAX];

 
int minim(int a, int b)
{
    if (a < b) return a;

    return b;
}



void read()
{
	int i;

	fin >> n >> m;

	for (i = 1; i <= m; i++)
	{
		f >> x >> y >> z;

		C[x][y] = z;
		v[x].push_back(y);
		v[y].push_back(x);
	}

}


 
int BFS()
{
    int V, nod, i, j;

    Q[0] = 1;
    Q[1] = 1;

    memset(viz, 0, sizeof(viz));

    viz[1] = 1;

    for (i = 1; i <= Q[0]; i++)
    {
        nod = Q[i];

        if (nod == N)
            continue;

        for (j = 0; j < v[nod].size(); j++)
        {
            V = v[nod][j];

            if (viz[V] || F[nod][V] == C[nod][V])
                continue;

            viz[V] = 1;

            TT[V] = nod;

            Q[ ++Q[0] ] = V;
        }
    }
 
    return viz[n];
}




void flux()
{
	int i, j;

	while(BFS())
	{
		flow = 0;

		for (i = 0; i < v[N].size(); i++)
		{
			V = v[N][i];
			TT[N] = V;
	
			if (F[V][N] == C[V][N] || !viz[V])
				continue;

			fmin = inf;

			for (j = N; j != 1; j = TT[j])
			{	
				fmin = minim(fmin, C[ TT[j] ][j] - F[ TT[j] ][j]);
			}

			if (fmin == 0)
				continue;

	
			for (j = N; j != 1; j = TT[j])
			{
				F[ TT[j] ][j] += fmin;
				F[j][ TT[j] ] -= fmin;
			}
			
			flow += fmin;
		}
	}

	fout << flow;

}



 
int main()
{
 	read();

	flux();	
   
	f.close();
	g.close();

	return 0;
}