#include <fstream>
#include <vector>
#define K 1002
#include <bitset>
using namespace std;
ifstream fin("maxflow.in");
ofstream fout("maxflow.out");
int n,m,i,x,y,z,f[K][K],c[K][K],q[K],t[K],flux,scad;
bitset <K> viz;
vector <int> v[K];
int bfs(){ // verif daca mai exista lant care sa ajunga in nodul n
    int p,u;
    viz.reset();
    q[1]=viz[1]=1;
    for(p=u=1;p<=u;p++){
        int nod=q[p];
        for(int i=0;i<v[nod].size();i++){
            int vecin=v[nod][i];
            if(!viz[vecin] && c[nod][vecin]>f[nod][vecin]){
                q[++u]=vecin;
                viz[vecin]=1;
                t[vecin]=nod;
                if(vecin==n)
                    return 1;
            }
        }
    }
    return 0;
}
int main(){
    fin>>n>>m;
    for(i=1;i<=m;i++){
        fin>>x>>y>>z;
        v[x].push_back(y);
        v[y].push_back(x);
        c[x][y]=z; //capacitate
        //c[y][x]=0 muchie fictiva inversata
        //f[x][y]=f[y][x]=0 initial
    }
    while(bfs()){
        scad=100000000;
        for(x=n;t[x];x=t[x])
            scad=min(scad,c[t[x]][x]-f[t[x]][x]);
        flux+=scad;
        for(x=n;t[x];x=t[x])
            f[t[x]][x]+=scad,
            f[x][t[x]]-=scad;
    }
    fout<<flux;
    return 0;
}