#include<cstdio>
#include<vector>
#include<queue>
#include<bitset>
using namespace std;
#define NMAX 1005
vector <int> L[NMAX];
bitset <NMAX> v;
queue <int> q;
int n,m,x,y,z,minim,flux,T[NMAX];
int C[NMAX][NMAX],F[NMAX][NMAX];
int bfs()
{
    int i;
    v.reset();
    T[1]=0, v[1]=1;
    q.push(1);
    while (!q.empty())
    {
        x=q.front(); q.pop();
        for (i=0;i<L[x].size();++i)
        {
            y=L[x][i];
            if (!v[y] && C[x][y]>F[x][y])
            {
                v[y]=1;
                T[y]=x;
                q.push(y);
            }
        }
    }
    return v[n];
}
int main()
{
    int i;
    freopen("maxflow.in","r",stdin);
    freopen("maxflow.out","w",stdout);
    scanf("%d%d",&n,&m);
    for (i=1;i<=m;++i)
    {
        scanf("%d%d%d",&x,&y,&z);
        L[x].push_back(y);
        L[y].push_back(x);
        C[x][y]=z;
    }
    while (bfs())
    {
        for (i=0;i<L[n].size();++i)
            if (v[L[n][i]] && C[L[n][i]][n]>F[L[n][i]][n])
            {
                x=L[n][i];
                minim=C[x][n]-F[x][n];
                while (T[x])
                {
                    minim=min(minim,C[T[x]][x]-F[T[x]][x]);
                    x=T[x];
                }
                flux+=minim;
                x=L[n][i];
                F[x][n]+=minim, F[n][x]-=minim;
                while (T[x])
                {
                    F[T[x]][x]+=minim, F[x][T[x]]-=minim;
                    x=T[x];
                }
            }
    }
    printf("%d\n",flux);
    return 0;
}