#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <cstring>
using namespace std;

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

int cost[1002][1002],n,m,a,b,c,T[1002],flux;
vector<int> EL[1002];
queue<int> coada;

int BF(){
    memset(T,0,n);
    T[1]=-1;
    coada.push(1);
    while(coada.size()>0){
        int k=coada.front();
        coada.pop();
        for(int i=0;i<EL[k].size();i++){
            if(cost[k][EL[k][i]]){
                int el=EL[k][i];
                T[el]=k;
                coada.push(el);
            }
        }
        if(k==n)return 1;
    }
    return 0;
}

int main()
{
    fin>>n>>m;
    while(m--){
        fin>>a>>b>>c;
        EL[a].push_back(b);
        cost[a][b]=c;
    }
    while(BF()){
        int j=n;int minim=99999999;
        while(j!=1){
            if(cost[T[j]][j]<minim)
                minim=cost[T[j]][j];
            j=T[j];
        }
        j=n;
        while(j!=1){
            cost[T[j]][j]-=minim;
            j=T[j];
        }
        flux+=minim;
    }
    fout<<flux;
    return 0;
}