#include <iostream>
#include <cstdio>
#include <vector>
#include <queue>
#include <cstring>

#define NMAX 1005
#define inf 0x3f3f3f3f

using namespace std;

int N,M;
int capacitati[NMAX][NMAX],utilizat[NMAX][NMAX];
vector<int> graf[NMAX];
int viz[NMAX],t[NMAX];


void citire()
{
    scanf("%d%d",&N,&M);
    for(int i=1; i<=M; i++)
    {
        int x,y,c;
        scanf("%d%d%d",&x,&y,&c);
        capacitati[x][y]=c;
        graf[x].push_back(y);
        graf[y].push_back(x);
    }
}

queue<int> q;
int rez;
int parcurgere()
{
    int ok=0;

    memset(viz,0,sizeof(viz));
    memset(t,0,sizeof(t));
    viz[1]=1;
    q.push(1);

    while(!q.empty())
    {
        int nod_curent = q.front();
        q.pop();

        if(nod_curent == N)
            continue;

        for(vector<int>::iterator ii = graf[nod_curent].begin(); ii!=graf[nod_curent].end(); ii++)
        {
            int nod_nou = *ii;
            if(!viz[nod_nou] && utilizat[nod_curent][nod_nou] != capacitati[nod_curent][nod_nou])
            {
                viz[nod_nou]=1;
                t[nod_nou]=nod_curent;
                q.push(nod_nou);
            }
        }
    }

    for(vector<int>::iterator ii = graf[N].begin(); ii!=graf[N].end(); ii++)
    {
        int vecin = *ii;
        int flux = inf;

        if(t[vecin])
            ok=1;

        while(t[vecin])
        {
            flux = min(flux, capacitati[t[vecin]][vecin] - utilizat[t[vecin]][vecin]);
            vecin = t[vecin];
        }

        vecin = *ii;

        while(t[vecin])
        {
            utilizat[t[vecin]][vecin] = flux;
            rez+=flux;
            vecin = t[vecin];
        }
    }
    return ok;
}

int main()
{
    freopen("maxflow.in","r",stdin);
    freopen("maxflow.out","w",stdout);

    citire();
    while(parcurgere());
    cout<<rez;

    return 0;
}