#include<fstream>
#include<iostream>
#include<vector>
#include <cstring>
#define INF 0x3f3f3f3f
using namespace std;
ifstream fin("maxflow.in");
ofstream fout("maxflow.out");



int n,m,k,i,j,p,x,y,t,cap,flux,fmin;
int C[1024][1024],F[1024][1024],coada[1024],viz[1024],prev[1024];

vector <int> v[1024];

bool bfs()
{
    //fout<<"ok";
    int nod, i, vecin,dr,st;
    st=dr=1;
    coada[st] = 1;
    viz[1] = 1;
    for(i=2;i<=n;i++) viz[i] = 0;

    while(st <= dr)
    {
        nod = coada[st];
        for(i=0;i<v[nod].size();i++)
        {
            vecin = v[nod][i];
            if(viz[vecin] == 0 and C[nod][vecin] != F[nod][vecin]) //daca muchia nu este saturata
            {
                dr++;
                coada[dr] = vecin;
                viz[vecin] = 1;
                prev[vecin] = nod;
                if(vecin == n) return true;
            }
            //fout<<vecin<<"\n";
        }
        //fout<<nod<<" ";
        st++;
    }
    return false;

}

int main()
{
    fin>>n>>m;
    for(i=1;i<=m;i++)
    {
        fin>>x>>y>>cap;
        C[x][y] += cap;
        v[x].push_back(y);
        v[y].push_back(x);

    }
    flux = 0;
    //bfs();
    while(bfs() == true)
    {
        //fout<<"merge\n";
        fmin =INF;
        int nod = n;
        while(nod != 1)
        {
            //fout<<nod<<"\n";
            fmin = min(fmin, C[prev[nod]][nod] - F[prev[nod]][nod]);
            nod = prev[nod];
        }
        nod = n;
        while(nod != 1)
        {
            //fout<<nod<<"\n";
            //fmin = min(fmin, C[prev[nod]][nod] - F[prev[nod]][nod]);
            F[prev[nod]][nod] += fmin;
            //F[nod][prev[nod]] -= fmin;
            nod = prev[nod];
        }
        flux = flux + fmin;
        //fout<<fmin<<" ";

    }
    fout << flux << "\n";
    for(i=1;i<=n;i++)
    {
        for(j=1;j<=n;j++)
        {
            //fout<<C[i][j]<<" ";
        }
        //fout<<"\n";
    }
}