#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#include <cstring>
#include <fstream>

using namespace std;

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

///flow_sent -> fluxul trimis pe o muchie, capacity -> capacitatea muchiei,
///good_flow -> fluxul maxim trimis pe drumul dat de BFS
int flow_sent[1005][1005], capacity[1005][1005], good_flow[1005] = {0};
///l -> vecorul care retine graful + graful rezidual
vector<int> l[1005];
///n -> noduri, m -> muchii
int n, m;
///vectprul de parinti
int tata[1005] = {0}, viz[1005] = {0};

int bfs()
{
    queue<int> q;
    memset(tata, 0, sizeof(tata));
    memset(viz, 0, sizeof(viz));

    q.push(1);
    viz[1] = 1;

    while(!q.empty())
    {
        int u = q.front();
        q.pop();
        if(u == n)
            return 1;
        for(int i = 0; i < l[u].size(); i++)
        {
            int v = l[u][i];
            ///inseamna ca nu e vizitat
            if(capacity[u][v] > 0 && !viz[v])
            {
                ///updatam vectorul de tati
                tata[v] = u;
                ///setam nodul ca vizitat
                viz[v] = 1;

                q.push(v);
            }
        }
    }
    return 0;
}

int edmonds_karp()
{
    int maxim = 0, flow, minim, u, v;
    while(bfs())
    {
        for(int i = 0; i < l[n].size(); i++)
        {
            u = l[n][i];
            if(capacity[u][n] > 0 && viz[u])
            {
                minim = capacity[u][n];
                while(tata[u])
                {
                    v = tata[u];
                    minim = min(minim, capacity[v][u]);
                    u = v;
                }
                maxim += minim;
                u = l[n][i];
                capacity[u][n] -= minim;
                capacity[n][u] += minim;
                while(tata[u])
                {
                    v = tata[u];
                    capacity[v][u] -= minim;
                    capacity[u][v] += minim;
                    u = v;
                }
            }
        }
    }
    return maxim;
}

int main()
{
    int s, f, cap, max_flow;
    in>>n>>m;
    while(m)
    {
        in>>s>>f>>cap;
        ///punem capacitatea de la nodul de start la cel de final
        capacity[s][f] = cap;
        ///graful propriu-zis
        l[s].push_back(f);
        ///graful rezidual
        l[f].push_back(s);
        m--;
    }

    max_flow = edmonds_karp();

    out<<max_flow<<"\n";

    return 0;
}