#include<fstream>
#include<vector>
#include<algorithm>
#include<cstring>
#define NMAX 1005
#define INF 2000000000
using namespace std;

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

int N,M,C[NMAX][NMAX],F[NMAX][NMAX],fmin,flow,q[NMAX],viz[NMAX],T[NMAX];

vector<int>L[NMAX];

int BF()
{
    int nod,ad;

    q[0]=1;q[1]=1;
    memset(viz,0,sizeof(viz));

    for (int i=1;i<=q[0];i++)
    {
        nod=q[i];

        if (nod==N) continue;

        for (int j=0;j<L[nod].size();j++)
        {   ad=L[nod][j];

            if (viz[ad] || C[nod][ad]==F[nod][ad]) continue;

            viz[ad]=1;
            q[0]++;
            q[ q[0] ] = ad;
            T[ad]=nod;
        }
    }

  if (viz[N]) return 1;
  return 0;
}


int main()
{
    f>>N>>M;
    int x,y,z;

    for (int i=1;i<=M;i++)
    {
        f>>x>>y>>z;
        C[x][y]=z;
        L[x].push_back(y);
        L[y].push_back(x);
    }

    int pen=0,fmin=INF;

    while ( BF() )
    {
        for (int i=0;i<L[N].size();i++)
        {
            pen=L[N][i];

            if (!viz[pen]||F[pen][N]==C[pen][N]) continue;

            T[N]=pen; fmin=INF;

            for (int j=N;j!=1;j=T[j])
              fmin=min(fmin,C[ T[j] ][ j ]-F[ T[j] ][ j ]);

            if (!fmin) continue;
            for (int j=N;j!=1;j=T[j])
            {
                F[ T[j] ][ j ] +=fmin;
                F[j][T[j]]-=fmin;
            }

            flow+=fmin;

        }
    }

    g<<flow;
return 0;
}