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

const int NMAX = 1010, INF = 0x3f3f3f3f;

int N, M, X, Y, Z, Cap[NMAX][NMAX], Flow[NMAX][NMAX], Father[NMAX], Source, Sink;
vector<int> G[NMAX];

bool BFS()
{
    for(int i = 1; i <= N; ++ i) Father[i] = -1;
    Father[Source] = 0;
    queue<int> Q;
    Q.push(Source);

    while(!Q.empty())
    {
        int Node = Q.front();
        Q.pop();

        if(Node == Sink) continue;

        for(vector<int> :: iterator it = G[Node].begin(); it != G[Node].end(); ++ it)
            if(Father[*it] == -1 && Cap[Node][*it] > Flow[Node][*it])
            {
                Father[*it] = Node;
                Q.push(*it);
            }
    }
    return Father[Sink] != -1;
}

void MaxFlow()
{
    int Ans = 0;
    while(BFS())
    {
        for(vector<int> :: iterator it = G[Sink].begin(); it != G[Sink].end(); ++ it)
            if(Father[*it] != -1 && Cap[*it][Sink] != Flow[*it][Sink])
            {
                Father[Sink] = *it;
                int MinFlow = INF;
                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;
            }
    }
    printf("%i\n", Ans);
}

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

    scanf("%i %i", &N, &M);
    for(int i = 1; i <= M; ++ i)
    {
        scanf("%i %i %i", &X, &Y, &Z);
        G[X].push_back(Y);
        G[Y].push_back(X);
        Cap[X][Y] = Z;
    }

    Source = 1;
    Sink = N;

    MaxFlow();
}