#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
#include <set>
#include <queue>
#include <deque>

using namespace std;

ifstream f("maxflow.in");
ofstream g("maxflow.out");

#define nmax 1005
#define Mmax 5005
#define ll long long
#define inf (1<<30)

int n, m, t[nmax], q[nmax+Mmax], capac[nmax][nmax], flux[nmax][nmax];
vector<int> gf[nmax];
bool viz[nmax];

void citeste(){
    f >> n >> m;
    int x, y, z;
    for(int i=1; i<=m; ++i){
        f >> x >> y >> z;
        capac[x][y] = z;
        gf[x].push_back(y); gf[y].push_back(x);
    }
}

inline bool bfs(int S, int D){
    for(int i=S; i<=D; ++i) viz[i] = 0;
    int st = 1; int dr = 0;
    q[++dr] = S; viz[S] = 1;
    for(; st<=dr; ){
        int nod = q[st]; ++st;
        for(int i=0; i<gf[nod].size(); ++i){
            int vc = gf[nod][i];
            if (viz[vc] == 0 && capac[nod][vc] > flux[nod][vc]){
                t[vc] = nod;
                viz[vc] = 1;
                if (vc == D) return 1;
                q[++dr] = vc;
            }
        }
    }
    return 0;
}

void rezolva(){
    int S = 1; int D = n; int Flux = 0;
    for(; bfs(S, D); ){
        int Min = inf;
        for(int i=D; i!=S; i=t[i]){
            Min = min(Min, capac[ t[i] ][i] - flux[ t[i] ][i]);
        }
        for(int i=D; i!=S; i=t[i]){
            flux[ t[i] ][i] += Min;
            flux[i][ t[i] ] -= Min;
        }
        Flux += Min;
    }
    cout << Flux << "\n";
    g << Flux << "\n";
}

int main(){
    citeste();
    rezolva();

    f.close();
    g.close();

    return 0;
}