#include<iostream>
#include<fstream>
#include<cstring>
#include<vector>
#include<queue>
#define NMax 1005
#define oo 1<<30
using namespace std;

ifstream fin("maxflow.in");
ofstream fout("maxflow.out");

int N,M,Sol;
int C_Flow[NMax][NMax],M_Flow[NMax][NMax],TT[NMax];
bool Use[NMax];

vector <int> G[NMax];
queue <int> Q;

void Read()
{
	fin>>N>>M;

	for(int i = 1 ; i <= M ; ++i)
	{
		int x,y,z;	fin>>x>>y>>z;
		M_Flow[x][y] = z;

		G[x].push_back(y);
		G[y].push_back(x);
	}
}

bool BFS()
{
    memset(Use,0,sizeof(Use));

    Q.push(1);	Use[1] = 1;

    while(!Q.empty())
	{
        int Nod = Q.front();	Q.pop();

        if(Nod == N)	continue;

        for(int i = 0 ; i < (int) G[Nod].size() ; ++i)
		{
			int Vecin = G[Nod][i];

			if( (M_Flow[Nod][Vecin] == C_Flow[Nod][Vecin]) || (Use[Vecin]) )	continue;

            Use[Vecin] = 1;
            TT[Vecin] = Nod;
            Q.push(Vecin);
		}
	}

	return Use[N];
}

void Solve()
{
    while(BFS())
	{
		for(int i = 0 ; i < (int) G[N].size() ; ++i)
        {
        	int Nod = G[N][i],Max = oo;

			if( (M_Flow[Nod][N] == C_Flow[Nod][N]) || (!Use[Nod]) )	continue;

			TT[N] =	Nod;
			Nod = N;

			while(Nod != 1)
			{
				Max = min(Max , M_Flow[TT[Nod]][Nod] - C_Flow[TT[Nod]][Nod]);
				Nod = TT[Nod];
			}

			if(!Max) continue;

			Nod = N;

			while(Nod > 0)
			{
				C_Flow[TT[Nod]][Nod] += Max;
				C_Flow[Nod][TT[Nod]] -= Max;
				Nod = TT[Nod];
			}

			Sol += Max;
        }
	}
}

void Print()
{
	fout<<Sol<<"\n";
}

int main()
{
	Read();
	Solve();
	Print();

	fin.close();
	fout.close();
	return 0;
}