#include <stdio.h>

#define NMAX 1000

#define INF 0x3f3f3f3f

int n, m;
short g[NMAX][NMAX];
int capacity[NMAX][NMAX];
short parent[NMAX];

short queue[NMAX];

inline int min(int a, int b)
{
    return (a < b) ? a : b;
}

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

    scanf("%d %d", &n, &m);

    for(int i = 0; i < m; i++)
    {
        int u, v, w;
        scanf("%d %d %d", &u, &v, &w);
        u--; v--;
        capacity[u][v] += w;
        g[u][++g[u][0]] = v;
        g[v][++g[v][0]] = u;
    }

    int flow = 0;
    while(true)
    {
        for(int i = 0; i < n; i++)
            parent[i] = -1;

        queue[0] = 1;
        queue[1] = 0;

        parent[0] = -2;

        for(int i = 1; i <= queue[0]; i++)
        {
            int u = queue[i];
            for(int i = 1; i <= g[u][0]; i++)
            {
                int v = g[u][i];
                if(parent[v] == -1 && capacity[u][v])
                {
                    parent[v] = u;
                    queue[++queue[0]] = v;
                }
            }
        }

        if(parent[n - 1] == -1)
            break;
        
        for(int i = 1; i <= g[n - 1][0]; i++)
        {
            int node = g[n - 1][i];
            if(parent[node] != -1 && capacity[node][n - 1])
            {
                parent[n - 1] = node;

                int maxflow = INF;
                for(node = n - 1; node != 0; node = parent[node])
                    maxflow = min(maxflow, capacity[parent[node]][node]);
                
                for(node = n - 1; node != 0; node = parent[node])
                {
                    capacity[parent[node]][node] -= maxflow;
                    capacity[node][parent[node]] += maxflow;
                }

                flow += maxflow;
            }
        }
    }

    printf("%d\n", flow);
    return 0;
}