#include<cstdio>
#include<vector>
#include<queue>
#include<bitset>
#define DIM 1005
using namespace std;
vector <int> L[DIM];
queue <int> q;
int n,m,x,y,z,minim,flux,T[DIM];
int C[DIM][DIM],F[DIM][DIM];
bitset<DIM> v;
int bf()
{
    int ok = 0;
    v.reset();
    int i;
    q.push(1);
    v[1] = 1;
    while (!q.empty())
    {
        x=q.front(); q.pop();
        for (int i=0;i<L[x].size();++i)
            if (!v[L[x][i]] && C[x][ L[x][i] ]>F[x][ L[x][i] ])
            {
                T[ L[x][i] ]=x;
                v[ L[x][i] ]=1;
                q.push(L[x][i]);
                if (L[x][i] == n)
                    ok = 1;
            }
    }
    return ok;
}

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;
        C[y][x]=0;
    }

    while ( bf() ) {
        for (int i=0; i<L[n].size(); i++) {
            if (v[ L[n][i] ] == 1 && C[L[n][i]][n] > F[L[n][i]][n]) {
                x = L[n][i];
                //saturam drumul care se termina cu muchia x,n
                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;
}