#include <bits/stdc++.h>

using namespace std;

ifstream fin ("maxflow.in");
ofstream fout ("maxflow.out");

int n, m, maxflux;
struct much{
    int a, b, c, f;
};
much a[10005];
vector <int> v[1005];
int last[1005];
queue <int> q;

void bfsclav(){
    for(int i = 1; i <= n; i++){
        last[i] = -1;
    }
    last[1] = 0;
    q.push(1);
    int nod;
    much nxt;
    while(!q.empty()){
        nod = q.front();
        q.pop();
        for(int i = 0; i < v[nod].size(); i++){
            nxt = a[v[nod][i]];
            if(last[nxt.b] == -1 && nxt.f < nxt.c){
                last[nxt.b] = v[nod][i];
                q.push(nxt.b);
            }
        }
    }
}

void fa_un_drum(){
    int nod = n;
    int minim_ude = INT_MAX;
    while(nod != 1){
        minim_ude = min(minim_ude, a[last[nod]].c - a[last[nod]].f);
        nod = a[last[nod]].a;
    }
    maxflux += minim_ude;
    nod = n;
    while(nod != 1){
        a[last[nod]].f += minim_ude;
        a[(last[nod]+m)%(2*m)].f -= minim_ude;
        nod = a[last[nod]].a;
    }
}

void fa_drumurile(){
    for(int i = 0; i < v[n].size(); i++){
        if(last[a[v[n][i]].b] != -1){
            last[n] = v[n][i] - m;
            fa_un_drum();
        }
    }
}

void flux(){
    int lastflux = -1;
    while(lastflux != maxflux){
        lastflux = maxflux;
        bfsclav();
        fa_drumurile();
    }
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    fin >> n >> m;
    for(int i = 1; i <= m; i++){
        fin >> a[i].a >> a[i].b >> a[i].c;
        v[a[i].a].push_back(i);
        a[i+m].a = a[i].b;
        a[i+m].b = a[i].a;
        v[a[i].b].push_back(i + m);
    }
    flux();
    fout << maxflux;
    return 0;
}