#include <fstream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <stack>
#include <iomanip>

#define NMax 1001
#define INF 0x3f3f3f3f
using namespace std;
ifstream w("maxflow.in");
ofstream g("maxflow.out");

int n,m,x,y,e,fm,F;
int f[NMax][NMax],c[NMax][NMax];
int viz[NMax],tata[NMax];
vector<int> G[NMax];
queue<int> q;

bool bfs(){
    memset(viz,0,sizeof(viz));

    viz[1] = 1;

    q.push(1);

    tata[1] = 0;

    while(!q.empty()){
        int nod = q.front();
        q.pop();
        if(nod == n)
            continue;
        for(int i = 0; i < G[nod].size(); ++i){
            if(!viz[G[nod][i]] && c[nod][G[nod][i]] != f[nod][G[nod][i]]){
                viz[G[nod][i]] = 1;

                tata[G[nod][i]] = nod;

                q.push(G[nod][i]);
            }
        }
    }
    return viz[n];
}
int main()
{
    w >> n >> m;
    for(int i = 1; i <= m; ++i){
        w >> x >> y >> e;
        c[x][y] = e;
        G[x].push_back(y);
        G[y].push_back(x);
    }
    while(bfs()){

        for(int i = 0; i < G[n].size(); ++i){

            if(!viz[G[n][i]] || c[G[n][i]][n] == f[G[n][i]][n])
                continue;

            tata[n] = G[n][i];

            fm = INF;

            for(int nod = n; nod != 1; nod = tata[nod]){
                fm = min(fm, c[tata[nod]][nod] - f[tata[nod]][nod]);
            }
            if(fm == 0)
                continue;

            for(int nod = n; nod != 1; nod = tata[nod]){
                f[tata[nod]][nod] += fm;
                f[nod][tata[nod]] -= fm;
            }

            F += fm;
        }
    }
    g << F;
    return 0;
}