#include <fstream>
#include <cstring>
#include <bitset>
#include <queue>
#include <list>
#define DIM 1011
using namespace std;
ifstream f("maxflow.in");
ofstream g("maxflow.out");
int n,m,minim,sol;
int C[DIM][DIM],F[DIM][DIM],T[DIM];
bool viz[DIM];

list<int> L[DIM];
list<int>::iterator it;
queue<int> Q;

bool bfs(){
    int nod;
    memset(viz,0,sizeof(viz));
    Q.push(1);
    while(!Q.empty()){
        nod=Q.front(),Q.pop(),viz[nod]=true;
        for(it=L[nod].begin();it!=L[nod].end();it++){
            if(!viz[*it] && C[nod][*it]>F[nod][*it])
                Q.push(*it),T[*it]=nod,viz[nod]=true;
        }
    }
    return viz[n];
}

int main(void){
    register int i,j,x,y,c;

    f>>n>>m;
    for(i=1;i<=m;i++){
        f>>x>>y>>c;
        L[x].push_back(y);
        L[y].push_back(x);
        C[x][y]=c;
    }

    while(bfs()){
        for(it=L[n].begin();it!=L[n].end();it++){
            if(viz[*it] && C[*it][n]>F[*it][n]){
                x=*it;
                minim=C[*it][n]-F[*it][n];
                while(T[x]) minim=min(minim,C[T[x]][x]-F[T[x]][x]),x=T[x];
                x=*it;
                F[x][n]+=minim,F[n][x]-=minim;
                while(T[x])
                    F[T[x]][x]+=minim,F[x][T[x]]-=minim,x=T[x];
                sol+=minim;
            }
        }
    }

    g<<sol;
    f.close();
    g.close();
    return 0;
}