#include<stdio.h>
#include<vector>
#include<queue>
#include<bitset>
#define Nmx 1002
#define INF 1000001

using namespace std;

int n,m,prec[Nmx],C[Nmx][Nmx];
vector < int > G[Nmx];
queue < int > Q;
bitset <Nmx> viz;

void citire()
{
    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;
        G[x].push_back(y);
        G[y].push_back(x);
    }
}

inline int bfs()
{
    int nod;
    vector <int> :: iterator it;
    viz.reset();
    viz[1]=1;
    for(Q.push(1);!Q.empty();Q.pop())
    if(Q.front()!=n)
    {
        nod=Q.front();
        for(it=G[nod].begin();it!=G[nod].end();++it)
            if(C[nod][*it]>0&&!viz[*it])
            {
                viz[*it]=1;
                prec[*it]=nod;
                Q.push(*it);
            }
    }
    return viz[n];
}

void solve()
{
    vector <int> :: iterator it;
    int i,j,sol=0;
    while(bfs())
    for(it=G[n].begin();it!=G[n].end();++it)
    {
        if(C[*it][n]>0&&viz[*it])
        {
            int Vmin=INF;
            prec[n]=*it;
            for(j=n;prec[j];j=prec[j])
                Vmin=min(Vmin,C[prec[j]][j]);
            if(Vmin)
            {
                for(j=n;prec[j];j=prec[j])
                {
                    C[prec[j]][j]-=Vmin;
                    C[j][prec[j]]+=Vmin;
                }
                sol+=Vmin;
            }
        }
    }
    printf("%d\n",sol);
}

int main()
{
    freopen("maxflow.in","r",stdin);
    freopen("maxflow.out","w",stdout);
    citire();
    solve();
    return 0;
}