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

const int NMAX = 1010, INF = 0x3f3f3f3f;

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

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

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

        for(int i = 0; i < G[Node].size(); ++ i)
        {
            int Vec = G[Node][i];
            if(Flow[Node][Vec] < Cap[Node][Vec] && !Used[Vec])
            {
                Used[Vec] = 1;
                Father[Vec] = Node;
                Q.push(Vec);
            }
        }
    }

    return Used[Sink];
}

void MaxFlow()
{
    int Ans = 0;
    while(BFS())
    {
        for(int i = 0; i < G[Sink].size(); ++ i)
        {
            int Vec = G[Sink][i];
            if(Used[Vec] && Flow[Vec][Sink] != Cap[Vec][Sink])
            {
                Father[Sink] = Vec;
                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);
        Cap[X][Y] = Z;
        G[X].push_back(Y);
        G[Y].push_back(X);
    }

    Source = 1;
    Sink = N;
    MaxFlow();
}