#include<cstdio>
#include<cstring>
#include<cmath>
#include<ctime>
#include<string>
#include<vector>
#include<queue>
#include<deque>
#include<set>
#include<list>
#include<stack>
#include<bitset>
#include<algorithm>
#define INF (1 << 30)
#define pb push_back
#define nxt (*it)
#define FOR(i,a,b)\
   for(int i=a; i<=b; ++i)
#define ALL(g)\
   for(typeof(g.begin()) it=g.begin(); it!=g.end(); ++it)
#define infile "maxflow.in"
#define outfile "maxflow.out"
#define nMax 1005
using namespace std;

vector < int > v[nMax];

bitset < nMax > used;

queue < int > Q;

int F[nMax][nMax], C[nMax][nMax];

int T[nMax];

int N, M, MaxFlow;


void read(){
    freopen(infile, "r", stdin);

    scanf("%d %d", &N, &M);

    int x, y, cost;
    FOR(i,1,M){
        scanf("%d %d %d", &x, &y, &cost);

        C[x][y] += cost;

        v[x].pb(y);
        v[y].pb(x);
    }

    fclose(stdin);
}

bool BFS(){
    used.reset();
    Q.push(used[1] = true);

    while(!Q.empty()){
        int x = Q.front();
        Q.pop();

        ALL(v[x]){
           if(used[nxt] || F[x][nxt] == C[x][nxt])
              continue;

            used[nxt] = true;
            T[nxt] = x;
            Q.push(nxt);
        }
    }

    return used[N];
}

void solve(){
    while(BFS()){
        ALL(v[N]){
            if(!used[nxt] || F[nxt][N] > C[nxt][N])
               continue;

            int fMin = INF;
            for(int node = N; node != 1; node = T[node])
               fMin = min(fMin, C[T[node]][node] - F[T[node]][node]);

            if(!fMin)
               continue;

            for(int node = N; node != 1; node = T[node]){
               F[T[node]][node] += fMin;
               F[node][T[node]] -= fMin;
            }

            MaxFlow += fMin;
        }
    }
}


void print(){
    freopen(outfile, "w", stdout);

    printf("%d\n", MaxFlow);

    fclose(stdout);
}

int main(){
    read();
    solve();
    print();

    return 0;
}