#include <iostream>
#include <vector>
#include <fstream>
#include <queue>
#include <algorithm>
using namespace std;
ifstream fin("maxflow.in");
ofstream fout("maxflow.out");

int c[1024][1024]; //capacitate intre doua noduri
int f[1024][1024]; //capacitate consumata
int tata[1024]; //tatal fiecarui nod
//vector<vector<int>> la; //lista de adiacenta
vector<int> la[1024];
//int coada[1024];
vector<int> vizitat;
int nod,n,m,x,y,z,i,j,minn,flow;

int bfs()
{
    vizitat.assign(n+1, 0);
    queue<int> coada;
	coada.push(1);
	while(!coada.empty())
    {
        nod=coada.front();
        coada.pop();
        vizitat[nod]=1;
        if(nod == n) break; //opresc parcurgerea daca ajung la destinatie
        for(int j=0;j<la[nod].size();j++)
        {
            if(vizitat[la[nod][j]]==0 && c[nod][la[nod][j]]!=f[nod][la[nod][j]]) //daca nu e vizitat si daca drumul nu a fost consumat
            {
                coada.push(la[nod][j]);
                vizitat[la[nod][j]];
                tata[la[nod][j]]=nod; //retin tatal nodului
            }
        }
    }
    return vizitat[n];//ne zice daca a ajuns la final drumul -> nu s a gasit fluxul maxim deci continuam
}

int main()
{
    fin>>n>>m;
    //la.resize(n+1);
    for(i =0;i<m;i++){
  		fin>>x>>y>>z;
  		la[x].push_back(y);
  		la[y].push_back(x);
  		c[x][y]=z;
  	}
  	flow=0;
  	while(bfs())
    {
        for(i=0;i<la[n].size();i++)
        {
            nod = la[n][i];
			if (f[nod][n] == c[nod][n] || !vizitat[nod]) continue;
			tata[n] = nod;
			int minn=9999999;
			for (j = n; j> 1; j = tata[j])
            {
  				minn = min(minn, c[tata[j]][j] - f[tata[j]][j]); //calculez capacitatea minima a drumului (capacitate totala-consumata)
  			}
			if (minn == 0) continue;
			for (j = n; j> 1; j = tata[j]) //modific capacitatile drumurilor+ maresc flowul rezidual
            {
  				f[tata[j]][j] += minn;
  				f[j][tata[j]] -= minn;
  			}
  			flow=flow+minn;
        }
    }
    fout<<flow;
    return 0;
}