#include<cstdio>
#include<vector>
#include<queue>
#define minim(a,b) a<b?a:b
using namespace std;
const int N=1005,INF=2000000000;
int n,ft,minf,tata[N],cap[N][N],flux[N][N];
bool f[N],viz[N];
vector<int> L[N];
queue<int> Q;
void read()
{
    int m,x,y,c;
    freopen("maxflow.in","r",stdin);
    freopen("maxflow.out","w",stdout);
    scanf("%d%d",&n,&m);
    for(int i=1;i<=m;i++)
    {
        scanf("%d%d%d",&x,&y,&c);
        cap[x][y]+=c, L[x].push_back(y);
        L[y].push_back(x);
    }
}
bool drum()
{
    Q.push(1);
    viz[1]=true;
    while(!Q.empty())
    {
        int nod=Q.front();
        Q.pop();
        if(nod==n)
            continue;
        for(vector<int>::iterator it=L[nod].begin();it!=L[nod].end();it++)
            if(!viz[*it] && flux[nod][*it]<cap[nod][*it])
            {
                viz[*it]=true;
                Q.push(*it);
                tata[*it]=nod;
            }
    }
    return viz[n];
}
void reset()
{
    for(int i=1;i<=n;i++)
    {
        viz[i]=false;
        tata[i]=0;
    }
}
void calculeaza(int nod)
{
    for(int i=nod;i!=1;i=tata[i])
        minf=minim(minf,cap[tata[i]][i]-flux[tata[i]][i]);
}
void propaga_flux(int nod)
{
    if(nod==1)
        return;
    propaga_flux(tata[nod]);
    flux[tata[nod]][nod]+=minf;
    flux[nod][tata[nod]]-=minf;
}
void solve()
{
    while(drum())
    {
        for(vector<int>::iterator it=L[n].begin();it!=L[n].end();it++)
            if(viz[*it])
            {
                minf=cap[*it][n]-flux[*it][n];
                calculeaza(*it);
                ft+=minf;
                propaga_flux(*it);
                flux[*it][n]+=minf;
                flux[n][*it]-=minf;
            }
        reset();
    }
}
int main()
{
    read();
    solve();
    printf("%d",ft);
    return 0;
}