#include <cstdio>
#include <cstdlib>
#include <vector>
#include <queue>
#include <cstring>
#include <algorithm>
using namespace std;

#define Nmax 1010
#define pb push_back
#define forit(it, v) for(typeof((v).begin()) it = (v).begin(); it != (v).end(); ++ it)

int N, M, Source, Sink, X, Y, C, Cap[Nmax][Nmax], Flow[Nmax][Nmax], Father[Nmax];
bool Used[Nmax];
vector<int> G[Nmax];

bool BFS()
{
    memset(Used, 0, sizeof(Used));
    memset(Father, 0, sizeof(Father));
    queue<int> Q;
    Q.push(Source);
    Used[Source] = 1;
    while(!Q.empty())
    {
        int Node = Q.front();
        Q.pop();
        if(Node == Sink) continue;
        forit(it, G[Node])
            if(!Used[*it] && Cap[Node][*it] > Flow[Node][*it])
            {
                Father[*it] = Node;
                Used[*it] = 1;
                Q.push(*it);
            }
    }
    return Used[Sink];
}

int MaxFlow()
{
    int Ans = 0;
    while(BFS())
    {
        forit(it, G[Sink])
            if(Used[*it] && Cap[*it][Sink] != Flow[*it][Sink])
            {
                Father[Sink] = *it;
                int MinFlow = 0x3f3f3f3f;
                for(int Node = Sink; Node != Source; Node = Father[Node])
                    MinFlow = min(MinFlow, Cap[Father[Node]][Node] - Flow[Father[Node]][Node]);
                for(int Node = Sink; Node != Source; Node = Father[Node])
                {
                    Flow[Father[Node]][Node] += MinFlow;
                    Flow[Node][Father[Node]] -= MinFlow;
                }
                Ans += MinFlow;
            }
    }
    return Ans;
}

int main()
{
    freopen("maxflow.in", "r", stdin);
    freopen("maxflow.out", "w", stdout);
    int i, j;
    scanf("%i %i", &N, &M);
    for(i = 1; i <= M; ++ i)
    {
        scanf("%i %i %i", &X, &Y, &C);
        G[X].pb(Y);
        G[Y].pb(X);
        Cap[X][Y] = C;
    }
    Source = 1;
    Sink = N;
    printf("%i\n", MaxFlow());
    return 0;
}