#include <bits/stdc++.h>
#define INF 0x3f3f3f3f

using namespace std;

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

int C[1010][1010], F[1010][1010];
int TT[1010], viz[1010];
vector<int> G[1010];
queue<int> cd;
int n, m;

int bf()
{
    int nod, V;
    cd.push(1);
    for(int i=1; i<=n; i++) viz[i]=0;
    while(!cd.empty())
    {
        nod=cd.front();
        for(int i=0;i<G[nod].size(); i++)
        {
            V=G[nod][i];
            if(C[nod][V] == F[nod][V] || viz[V]) continue;
            viz[V]=1;
            cd.push(V);
            TT[V]=nod;
            if(V==n) return 1;
        }
        cd.pop();
    }
    return 0;
}

int main()
{
    int x, y, z, fmin, flow;
    fin >> n >> m;
    for(int i=1; i<=m; i++)
    {
        fin>>x>>y>>z;
        G[x].push_back(y);
        G[y].push_back(x);
        C[x][y]+=z;
    }
    flow=0;
    while(bf())
    {
        fmin=INF;
        for(int nod=n; nod != 1; nod=TT[nod])
            fmin=min(C[TT[nod]][nod]-F[TT[nod]][nod], fmin);
        for(int nod=n; nod!=1; nod=TT[nod])
        {
            F[nod][TT[nod]]-=fmin;
            F[TT[nod]][nod]+=fmin;
        }
        flow+=fmin;
    }
    fout<<flow;

    return 0;
}