#include <fstream>
#include <vector>
#include <queue>
using namespace std;
#define MAXN 1005
#define INF 0x3f3f3f3f

ifstream cin("maxflow.in");
ofstream cout("maxflow.out");

vector<int> graf[MAXN];
queue<int> coada;
int capacitate[MAXN][MAXN], flux[MAXN][MAXN], tata[MAXN];
int n,m,x,y,z,penultim;
int flux_total, flux_crt;
bool fol[MAXN];

int bfs(int start, int fin)
{
    int act,urm,i;
    while(!coada.empty())
        coada.pop();

    for(i=1; i<=n; i++)
        tata[i] = fol[i] = 0 ;

    fol[start] = true;
    coada.push(start);
    while(!coada.empty())
    {
        act = coada.front(); coada.pop();
        if( act == n )
            return 1;

        for(i=0; i<graf[act].size(); i++)
        {
            urm = graf[act][i];
            if(!fol[urm] && capacitate[act][urm] > flux[act][urm])
            {
                fol[urm] = true;
                tata[urm] = act;
                coada.push(urm);
            }
        }
    }

    return 0;

}
int main()
{
    int i,j;
    cin>>n>>m;
    for(i=1; i<=m; i++)
    {
        cin>>x>>y>>z;
        graf[x].push_back(y);
        graf[y].push_back(x);
        capacitate[x][y] = z;
    }

    while(bfs(1,n))
    {
        for(i=0; i<graf[n].size(); i++)
        {
            penultim = graf[n][i];
            if(fol[penultim] && capacitate[penultim][n] > flux[penultim][n])
            {
                tata[n] = penultim;
                flux_crt = INF;
                for(j=n; j!=1; j=tata[j])
                    if( flux_crt > capacitate[tata[j]][j] - flux[tata[j]][j])
                        flux_crt = capacitate[tata[j]][j] - flux[tata[j]][j];

                for(j=n; j!=1; j=tata[j])
                {
                    flux[tata[j]][j] += flux_crt;
                    flux[j][tata[j]] -= flux_crt;
                }

                flux_total += flux_crt;
            }
        }
    }
    cout<<flux_total;
    return 0;
}