#include <iostream>
#include<fstream>
#include<vector>
#define inf 1000000
using namespace std;
ifstream f("maxflow.in");
ofstream g("maxflow.out");
int sz,c[1000000],C[1001][1001],F[1001][1001],k,i,flow,fmin,n,m,father[1001],x,y,cst;
vector<int>v[1001];
bool viz[1001];
int bfs()
{
    sz=1;
    c[1]=1;
    int i,nod;
    for(i=1;i<=n;i++)
        viz[i]=0;
    viz[1]=1;
    for(i=1;i<=sz;i++)
    {
        nod=c[sz];
        for(k=0;k<v[nod].size();k++)
        {
            if(viz[v[nod][k]] || F[nod][v[nod][k]]==C[nod][v[nod][k]])
                continue;
            c[++sz]=v[nod][k];
            viz[v[nod][k]]=1;
            father[c[sz]]=nod;
            if(c[sz]==n)
                return 1;
        }
    }
    return 0;
}
int main()
{
    f>>n>>m;
    for(i=1;i<=m;i++)
    {
        f>>x>>y>>cst;
        v[x].push_back(y);
        v[y].push_back(x);
        C[x][y]=cst;
    }
    for(flow=0;bfs();flow+=fmin)
    {
        fmin=inf;
        for(i=n;i!=1;i=father[i])
        {
            //int c1=C[father[i]][i];
            //int f1=F[father[i]][i];
            fmin=min(fmin,C[father[i]][i]-F[father[i]][i]);
        }

        for(i=n;i!=1;i=father[i])
        {
            F[father[i]][i]+=fmin;
            F[i][father[i]]-=fmin;
        }
    }
    g<<flow;
}