#include<cstdio>
#include<vector>
#include<cstring>
#include<algorithm>
#include<queue>
using namespace std;
FILE*in=fopen("maxflow.in","r");
FILE*out=fopen("maxflow.out","w");
const int INF=1000000004;
int n,m,i,x,xx,y,z,ct,ctt;
int mat[1003][1003],cap[1003][1003],dady[1003],g=0;
bool b[1003];
bool as;
struct drum
{
    int tat,fi;
};
drum d,e;
queue<drum> q;
vector<int> v[1003];
void fluxeaza()
{
    int nd=n,minn=INF;
    while(dady[nd]!=0)
    {
        minn=min(minn,mat[dady[nd]][nd]-cap[dady[nd]][nd]);
        nd=dady[nd];
    }
    nd=n;
    while(dady[nd]!=0)
    {
        cap[dady[nd]][nd]+=minn;
        cap[nd][dady[nd]]-=minn;
        nd=dady[nd];
    }
    ct+=minn;
}
void fl()
{
    while(!q.empty())
    {
        d=q.front();
        q.pop();
        dady[d.fi]=d.tat;
        for(auto t:v[d.fi])
        {
            if(b[t]==0&&mat[d.fi][t]-cap[d.fi][t]>0)
            {
                if(t==n)
                {
                    dady[n]=d.fi;
                    fluxeaza();
                    continue;
                }
                b[t]=1;
                e.tat=d.fi;
                e.fi=t;
                q.push(e);
            }
        }
    }
}
int main()
{
    fscanf(in,"%d%d",&n,&m);
    for(i=1;i<=m;i++)
    {
        fscanf(in,"%d%d%d",&x,&y,&z);
        mat[x][y]=z;
        v[x].push_back(y);
        v[y].push_back(x);
    }
    while(true)
    {
        memset(b,0,sizeof(b));
        d.tat=0;
        d.fi=1;
        q.push(d);
        b[1]=1;
        fl();
        if(ct==ctt)
        {
            break;
        }
        ctt=ct;
    }
    fprintf(out,"%d",ct);
}