#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream fin("maxflow.in");
ofstream fout("maxflow.out");
vector <int > v[1010];
queue <int > q,n;
int t[1010],N,M,a[1010][1010],b[1010][1010],viz[1010],S,p,r;
int main()
{
    int x,y,z,i,ok,minn;
    fin>>N>>M;
    for(i=1; i<=M; i++)
    {
        fin>>x>>y>>z;
        v[x].push_back(y);
        v[y].push_back(x);
        a[x][y]=z;
    }
    ok=1;
    while(ok==1)
    {
        ok=0;
        q.push(1);
        viz[1]=1;
        while(!q.empty())
        {
            p=q.front();
            q.pop();
            for(auto it:v[p])
            {
                if(viz[it]==0&&b[p][it]<a[p][it])
                {
                    if(it==N)
                    {
                        ok=1;
                        n.push(p);
                    }
                    else
                    {
                        viz[it]=1;
                        q.push(it);
                        t[it]=p;
                    }
                }
            }
        }
        if(ok==1)
        {
            while(!n.empty())
            {
                t[N]=n.front();
                r=N;
                n.pop();
                minn=999999;
                while(r!=1&&minn!=0)
                {
                    minn=min(minn,a[t[r]][r]-b[t[r]][r]);
                    r=t[r];
                }
                r=N;
                S+=minn;
                while(r!=1&&minn!=0)
                {
                    b[t[r]][r]+=minn;
                    b[r][t[r]]-=minn;
                    r=t[r];
                }
            }

            for(i=1; i<=N; i++)
            {
                t[i]=0;
                viz[i]=0;
            }
        }
    }
    fout<<S;
}