#include <fstream>
#include <cstring>
#include <vector>

using namespace std;

const int INF = 2000000000;

bool viz[1005];

int T[1005],C[1005][1005],F[1005][1005],q[1005];

vector<int> L[1005];
vector<int>::iterator it;

int n,m,i,p,u,x,y,z,nod,Min,flow;

inline int minim(int a, int b) {
    return a<b ? a : b;
}

bool BFS() {
    memset(viz,0,n+1);
    viz[1]=1;
    p=u=1;
    q[1]=1;
    while(p<=u) {
        if(q[p]==n) {
            p++;
            continue;
        }
        nod=q[p];
        for(it=L[nod].begin();it!=L[nod].end();it++) {
            if(viz[*it] || C[nod][*it]==F[nod][*it])
                continue;
            viz[*it]=1;
            u++;
            q[u]=*it;
            T[*it]=nod;
        }
        p++;
    }
    return viz[n];
}

int main() {
    ifstream f("maxflow.in");
    ofstream g("maxflow.out");
    f>>n>>m;
    for(i=1;i<=m;i++) {
        f>>x>>y>>z;
        L[x].push_back(y);
        L[y].push_back(x);
        C[x][y]=z;
    }
    while( BFS() ) {
        for(it=L[n].begin();it!=L[n].end();it++) {
            if(!viz[*it] || C[*it][n]==F[*it][n])
                continue;
            T[n]=*it;
            Min=INF;
            for(i=n;i!=1;i=T[i])
                Min=minim(Min,C[T[i]][i]-F[T[i]][i]);
            if(Min==0)
                continue;
            flow+=Min;
            for(i=n;i!=1;i=T[i]) {
                F[T[i]][i]+=Min;
                F[i][T[i]]-=Min;
            }
        }
    }
    g<<flow<<"\n";
    return 0;
}