#include <bits/stdc++.h>
using namespace std;
ifstream f ("maxflow.in");
ofstream g ("maxflow.out");
const int nmax=1e3+3;
int n,m,act,ant[nmax],usu[nmax][nmax],p[nmax][nmax],sol,x,y,c;
bool viz[nmax];
vector <int> v[nmax];
queue <int> q;
bool solve()
{
    memset(viz,0,sizeof(viz));
    q.push(1);
    viz[1]=1;
    while(!q.empty())
    {
        int nod=q.front();
        q.pop();
        if(nod==n) continue;
        for(int i=0;i<v[nod].size();++i)
        {
            int urm=v[nod][i];
            if(usu[nod][urm]==p[nod][urm]||viz[urm]) continue;
            q.push(urm);
            viz[urm]=1;
            ant[urm]=nod;
        }
    }
    return viz[n];
}
int main()
{
    ios::sync_with_stdio(false);
    f>>n>>m;
    for(int i=1;i<=m;++i)
    {
        f>>x>>y>>c;
        usu[x][y]+=c;
        v[x].push_back(y);
        v[y].push_back(x);
    }
    while(true)
    {
        int ok=solve();
        for(int i=0;i<v[n].size();++i)
        {
            int nod=v[n][i];
            if(p[nod][n]==usu[nod][n]||!viz[nod]) continue;
            ant[n]=nod;
            act=2e9;
            for(nod=n;nod!=1;nod=ant[nod]) act=min(act,usu[ant[nod]][nod]-p[ant[nod]][nod]);
            if(!act) continue;
            for(nod=n;nod!=1;nod=ant[nod])
            {
                p[ant[nod]][nod]+=act;
                p[nod][ant[nod]]-=act;
            }
            sol+=act;
        }
        if(!ok) break;
    }
    g<<sol;
    return 0;
}