#include<fstream>
#include<vector>
#include<cstring>
using namespace std;
int n,m,q[1001],t[1001],viz[1001],flux[1001][1001],c[1001][1001],fl,sum;
vector<int>v[1001];
ifstream fin("maxflow.in");
ofstream fout("maxflow.out");
void citire()
{
    int x,y,f;
    fin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        fin>>x>>y>>f;
        v[x].push_back(y);
        v[y].push_back(x);
        c[x][y]=f;
    }
}

int bfs()
{
    int u,p,nod,cap;
    p=u=1;
    viz[1]=1;
    q[1]=1;
    while(p<=u)
    {
        for(int i=0;i<v[q[p]].size();i++)
        {
            nod=v[q[p]][i];
            if(viz[nod]==0 && c[q[p]][nod]>flux[q[p]][nod])
            {
                q[++u]=nod;
                t[nod]=q[p];
                viz[nod]=1;
            }
        }
        p++;
    }
    return viz[n];
}

int parinti(int nod)
{
    int mini=c[nod][n]-flux[nod][n];
    while(nod!=1)
    {
        if(mini>c[t[nod]][nod]-flux[t[nod]][nod])
        {
            mini=c[t[nod]][nod]-flux[t[nod]][nod];
        }

        nod=t[nod];
    }
    return mini;
}

void detFlux(int nod)
{
    flux[nod][n]+=fl;
    flux[n][nod]-=fl;
    while(nod!=1)
    {
        flux[nod][t[nod]]-=fl;
        flux[t[nod]][nod]+=fl;
        nod=t[nod];
    }
}
int main()
{
    int nod;
    citire();
    while(bfs())
    {

        for(int i=0;i<v[n].size();i++)
        {
            nod=v[n][i];
            if(flux[nod][n]==c[nod][n] || viz[nod]==0)
                continue;


            fl=parinti(nod);
            if(fl==0)
                continue;
            detFlux(nod);
            sum+=fl;
        }
        memset(t,0,sizeof(t));
        memset(viz,0,sizeof(viz));
    }
    fout<<sum;
    return 0;
}