#include <bits/stdc++.h>
using namespace std;

int n, m, TT[1005];
int C[1005][1005], F[1005][1005];
bool f[1005];
vector <int> v[1005];
queue <int> q;
const int INF = 2000000000;
inline bool Bfs(){
    memset(f, 0, sizeof(f));
    q.push(1);
    f[1] = 1;
    while(!q.empty()){
        int nod = q.front();
        q.pop();
        if(nod == n) continue ;
        for(auto it : v[nod]){
            if(C[nod][it] == F[nod][it] || f[it]) continue ;
            q.push(it);
            f[it] = 1;
            TT[it] = nod;
        }
    }
    return f[n];
}
int main(){
    freopen("maxflow.in", "r", stdin);
    freopen("maxflow.out", "w", stdout);
    scanf("%d%d", &n, &m);
    int x, y, c;
    for(int i = 1; i <= m ; ++i){
        scanf("%d%d%d", &x, &y, &c);
        C[x][y] += c;
        v[x].push_back(y);
        v[y].push_back(x);
    }
    int flow;
    for(flow = 0; Bfs() ;){
        for(auto it : v[n]){
            int nod = it;
            if(F[nod][n] == C[nod][n] || !f[nod]) continue ;
            TT[n] = nod;
            int fmin = INF;
            for(nod = n; nod != 1 ; nod = TT[nod])
                fmin = min(fmin, C[TT[nod]][nod] - F[TT[nod]][nod]);
            if(fmin == 0) continue ;
            for(nod = n; nod != 1 ; nod = TT[nod]){
                F[TT[nod]][nod] += fmin;
                F[nod][TT[nod]] -= fmin;
            }
            flow += fmin;
        }
    }
    printf("%d", flow);
    return 0;
}