#include <fstream>
#include <vector>
#include <bitset>
#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],q[DIM+11],T[DIM];

vector<int> L[DIM];
vector<int>::iterator it;
bitset<DIM> viz;

int bfs(){
    q[1]=1;
    int p=1,u=1,nod;
    viz.reset();
    viz[1]=1;
    while(p<=u){
        nod=q[p];
        for(it=L[nod].begin();it!=L[nod].end();it++){
            if(!viz[*it] && C[nod][*it]>F[nod][*it]){
                q[++u]=*it;
                T[*it]=nod;
                viz[*it]=1;
            }
        }
        p++;
    }
    return viz[n];
}

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

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

    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]>0) minim=min(minim,C[T[x]][x]-F[T[x]][x]),x=T[x];
                x=*it;
                F[*it][n]+=minim;
                F[n][*it]-=minim;
                while(T[x]>0){
                    F[T[x]][x]+=minim;
                    F[x][T[x]]-=minim;
                    x=T[x];
                }
                sol+=minim;
            }
        }
    }

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