#include <iostream>
#include <fstream>
#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;
queue<int> coada;

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

int main()
{
    fin>>n>>m;
    while(m--){
        fin>>a>>b>>c;
        cost[a][b]=c;
    }
    while(BF()){
        int j=n,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;
            cost[j][T[j]]+=minim;
            j=T[j];
        }
        flux+=minim;
    }
    fout<<flux;
    return 0;
}