#include <fstream>
#include <iostream>
#include <bitset>
#include <vector>
#include <deque>
#define DIM 1010
using namespace std;
ifstream fin("maxflow.in");
ofstream fout("maxflow.out");
bitset<DIM> U;
vector<int> L[DIM];
int C[DIM][DIM],F[DIM][DIM],T[DIM];
deque<int> q;
int n,m,i,x,y,z,flux,cp,p,mn;
int bfs(){
    int destinatie=0;
    U.reset();
    U[1]=1;
    q.push_back(1);
    while(!q.empty()){
        int nod=q.front();
        for(int i=0;i<L[nod].size();i++){
                int vecin=L[nod][i];
                if(U[vecin]==0 && C[nod][vecin]>F[nod][vecin]){
                    U[vecin]=1;
                    q.push_back(vecin);
                    T[vecin]=nod;
                    if(vecin==n)
                        destinatie=1;

                }

        }
        q.pop_front();
    }
    return destinatie;


}
int main(){
    fin>>n>>m;
    for(i=1;i<=m;i++){
        fin>>x>>y>>z;
        L[x].push_back(y);
        L[y].push_back(x);
        C[x][y]=z;
    }
    while(bfs()){
        for(i=0;i<L[n].size();i++){
            p=L[n][i];
                if(C[p][n] > F[p][n] && U[p]==1 ){
                mn=C[p][n]-F[p][n];
                cp=p;
                while(T[cp]){
                    if(C[T[cp]][cp]-F[T[cp]][cp] < mn)
                       mn=C[T[cp]][cp]-F[T[cp]][cp];
                    cp=T[cp];
                }
                flux+=mn;
                F[p][n] += mn;
                F[n][p] -= mn;
                cp=p;
                while(T[cp]){
                    F[T[cp]][cp]+=mn;
                    F[cp][T[cp]]-=mn;
                    cp=T[cp];
                }
                }
        }
    }
    fout<<flux;

    return 0;
}