#include <bits/stdc++.h>

using namespace std;

ifstream fin("maxflow.in");
ofstream fout("maxflow.out");

int n,m,A,B,C,i,ans,fc,j;

int t[1001];

int c[1001][1001],f[1001][1001];

vector <int> v[1001];

bool bf()
{
    int nod;
    queue <int> q;
    memset(t,0,sizeof(t));
    t[1]=-1;q.push(1);
    while(!q.empty())
    {
        nod=q.front();q.pop();
        for(auto it:v[nod])
        {
            if(t[it]||c[nod][it]==f[nod][it])continue;
            t[it]=nod;
            q.push(it);
            if(it==n)return 1;
        }
    }
    return 0;
}

int main()
{
    fin>>n>>m;
    for(i=1;i<=m;i++)
    {
        fin>>A>>B>>C;
        v[A].push_back(B);
        c[A][B]=C;
    }
    while(bf())
    {
        for(i=1;i<=n;i++)
        {
            if(!t[i]||c[i][n]==f[i][n])continue;
            fc=c[i][n]-f[i][n];
            for(j=i;j>1;j=t[j])
                fc=min(fc,c[t[j]][j]-f[t[j]][j]);
            if(!fc)continue;
            f[i][n]+=fc;
            f[n][i]-=fc;
            for(j=i;j>1;j=t[j])
            {
                f[t[j]][j]+=fc;
                f[j][t[j]]-=fc;
            }
            ans+=fc;
        }
    }
    fout<<ans;
    return 0;
}