#include<iostream>
#include<fstream>
#include<cmath>
#include<algorithm>
#include<vector>
#include<bitset>
#include<cstring>
#include<queue>
#include<stack>

#define ull unsigned long long
#define ll long long
#define pb push_back
#define FOR(a,b,c) for (int a=b;a<=c; ++a)
#define ROF(a,b,c) for (int a=b;a>=c; --a)
#define INF 550000010

using namespace std;
ifstream f("maxflow.in");
ofstream g("maxflow.out");
int N,M;
int cap[1010][1010],flow[1010][1010],prg[1010],dad[1010];

vector<int> v[1010];
bitset<1010> verif;

bool bfs();

int main()
{
    f>>N>>M;
    FOR (i,1,M) {
        int x,y,c;
        f>>x>>y>>c;
        v[x].pb(y);
        v[y].pb(x);
        cap[x][y]=c;
    }
    int flowtotal=0,flowc;
    for (;bfs();flowtotal+=flowc) {
        flowc=INF;
        for (int i=N;i!=1;i=dad[i]) {
            flowc=min(flowc,cap[dad[i]][i]-flow[dad[i]][i]);
        }
        for (int i=N;i!=1;i=dad[i]) {
            flow[dad[i]][i]+=flowc;
            flow[i][dad[i]]-=flowc;
        }
    }
    g<<flowtotal;
    f.close();g.close();
    return 0;
}

bool bfs() {
    verif.reset();
    int nr=1,i=1;
    prg[1]=1;
    verif.set(1,1);
    while (i<=nr) {
        int nod=prg[i];
        vector<int>::iterator it;
        for (it=v[nod].begin();it<v[nod].end();++it) {
            if (!verif.test(*it) && cap[nod][*it]!=flow[nod][*it]) {
                verif.set(*it,1);
                dad[*it]=nod;
                prg[++nr]=*it;
                if (*it==N) {
                    return 1;
                }
            }
        }
        ++i;
    }
    return 0;
}