#include <stdio.h>
#include <queue>
#include <vector>
using namespace std;
int n,m,i,x,y,z,C[1001][1001],f[1001],t[1001],nr,j,flux;
vector<int> G[1001];
queue<int> Q;
bool BFS()
{
    int i;
    Q.push(1);
    while (!Q.empty())
    {
        x=Q.front();
        Q.pop();
        for (i=0;i<G[x].size();i++)
            if (!t[G[x][i]]&&C[x][G[x][i]])
            {
                Q.push(G[x][i]);
                t[G[x][i]]=x;
            }
    }
    return (t[n]!=0);
}
int main()
{
    freopen ("maxflow.in","r",stdin);
    freopen ("maxflow.out","w",stdout);
    scanf("%i%i",&n,&m);
    for (i=1;i<=m;i++)
    {
        scanf("%i%i%i",&x,&y,&z);
        C[x][y]=z;
        G[x].push_back(y);
        if (y==n) f[++nr]=x;
    }
    while (BFS())
    {
        for (i=1;i<=nr;i++)
            if (C[f[i]][n])
        {
            z=C[f[i]][n];
            for (j=t[n];j!=1;j=t[j])
                z=min(z,C[t[j]][j]);
            flux+=z;
            C[f[i]][n]-=z;
            C[n][f[i]]+=z;
            for (j=t[n];j!=1;j=t[j])
            {
                C[t[j]][j]-=z;
                C[j][t[j]]+=z;
            }
        }
        for (i=1;i<=n;i++) t[i]=0;
    }
    printf("%i",flux);
    fclose(stdin);
    fclose(stdout);
    return 0;
}