# include <iostream>
# include <fstream>
# include <vector>
# include <string.h>
# include <cstdlib>
# include <queue>
# define nmax 1002
# define inf 140000
using namespace std;

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

int n, m, viz[nmax], f[nmax][nmax], c[nmax][nmax], p[nmax];
vector <int> a[nmax];

int bf()
{
    int i,k,nod;
    queue <int> q;
    q.push(1);
    viz[1]=1;

    while(!q.empty())
    {
        nod=q.front();
        q.pop();
        for(i=0; i<a[nod].size(); i++)
        {
            k=a[nod][i];
            if(!viz[k] && c[nod][k] > f[nod][k])
            {
                q.push(k);
                viz[k]=1;
                p[k]=nod;
            }
        }
    }

    return viz[i];

}


int main()
{
    fin>>n>>m;
    int i,x,y,z, mfl=0;

    for(i=1; i<=m; i++)
    {
        fin>>x>>y>>z;
        a[x].push_back(y);
        a[y].push_back(x);
        c[x][y]=z;
    }

    int nod,fmin;
    while(bf())
    {
        fmin=inf;
        for(nod=n; nod!=1; nod=p[nod])
            fmin=min(fmin, c[p[nod]][nod] - f[p[nod]][nod]);

        for(nod=n; nod!=1; nod=p[nod])
        {
            f[p[nod]][nod]+=fmin;
            f[nod][p[nod]]-=fmin;
        }

        mfl+=fmin;
        memset(viz, 0, sizeof(viz));
    }

    cout<<mfl;

    return 0;
}