#include <bits/stdc++.h>
#define INF 2000000000
#define VMAX 1005
#define NMAX 5005
using namespace std;
ifstream fin ("maxflow.in");
ofstream fout ("maxflow.out");

int flux_pe_muchie[NMAX];
bool vizitat[VMAX];
int n;

struct mch{
int nod;
int limita;
int id;
//bool muchie_normala;
};
vector<mch> graf[VMAX];
// cat flux merge prin muchie si limita


int dfs(int nod, int minim) // minim repr cat flux avem de distribuit prin muchiile din nodul nod
{
    int flux_total = 0;
    if(nod == n) // am ajuns la sink
        return minim;
    vizitat[nod]=1;


    for(auto i:graf[nod])
    {
        if(vizitat[i.nod])
            continue;
        if(i.limita==0 && flux_pe_muchie[i.id]>0) // muchie inversa si avem de unde intoarce flux
        {
            int nr = dfs(i.nod,min(minim,flux_pe_muchie[i.id])); // cat flux a incaput prin acel path
            if(nr)
            {
                flux_pe_muchie[i.id]-=nr;
                flux_total+=nr;
                minim-=nr;
                //vizitat[nod]=0;
                //return nr;
            }
        }
        else if(i.limita>0 && i.limita-flux_pe_muchie[i.id]>0) // muchie normala si avem unde adauga flux
        {
            int nr = dfs(i.nod,min(minim,i.limita-flux_pe_muchie[i.id])); // cat flux a incaput prin acel path
            if(nr)
            {
                flux_pe_muchie[i.id]+=nr;
                flux_total+=nr;
                minim-=nr;
                //vizitat[nod]=0;
                //return nr;
            }
        }
    }

    //return 0;
    vizitat[nod]=0;
    return flux_total;
}


int main()
{
    long long int m,i,j,k,t,q,nr,suma,max_flow;
    mch model;
    fin>>n>>m;
    for(i=0;i<m;i++)
    {
        model.id=i;
        fin>>j>>k>>t;
        model.nod=k;
        model.limita=t;
        graf[j].push_back(model);
        model.limita=0;
        model.nod = j;
        graf[k].push_back(model);
    }

    max_flow=0;
    while(nr=dfs(1,INF))
    {
        max_flow+=nr;
    }


    fout<<max_flow<<'\n';



    return 0;
}