#include <cstdio>
#include <algorithm>
#include <vector>
#include <queue>
#include <climits>
using namespace std;
int c[1010][1010],f[1010][1010],m,n,i,x,y,cst,t[1010],nod,flux,mi,nrr=0,naa=0;
vector<int>v[1010],ter;
queue<int>q;
bool bsf ()
{
    q.push (1);
    t[1] = -1;
    bool OK = false;
    for (; !q.empty (); q.pop ())
    {
        int nod = q.front ();

        for (auto &it : v[nod])
        {
            if (it == n)
            {
                if (c[nod][it] > f[nod][it])
                    OK = true,
                    ter.push_back (nod);

                continue;
            }

            if (!t[it] && c[nod][it] > f[nod][it])
                t[it] = nod,
                        q.push (it);
        }
    }

    return OK;
}
void del()
{
    vector<int>aa;
    aa.swap(ter);
}
int main()
{
    freopen("maxflow.in","r",stdin);
    freopen("maxflow.out","w",stdout);
    scanf("%d%d",&n,&m);
    for(i=1; i<=m; ++i)
    {
        scanf("%d%d%d",&x,&y,&cst);
        if(!c[x][y])v[x].push_back(y);
        c[x][y]+=cst;
        if (!c[y][x]) v[y].push_back (x);
    }
    for (; bsf ();)
    {
        for(auto &it: ter)
        {
            mi=INT_MAX;
            nod=n;
            t[n]=it;
            while(t[nod]!=-1)
            {
                mi=min(mi,c[t[nod]][nod]-f[t[nod]][nod]);
                nod=t[nod];
            }
            flux+=mi;
            nod=n;
            while(t[nod]!=-1)
            {
                f[t[nod]][nod]+=mi;
                f[nod][t[nod]]-=mi;
                nod=t[nod];
            }
        }
        for(i=1; i<=n; ++i)
            t[i]=0;
        del();
    }
    printf("%d\n",flux);
    return 0;
}