/*
 *  Created by Andrei Arhire 22/02/2021
 *  Copyright © 2021 Andrei Arhire. All rights reserved.
 */
import java.util.*;
import java.io.*;

public class Main {
    public static void main(String[] args) throws IOException {
        /*
        InputStream inputStream = System.in;
		OutputStream outputStream = System.out;
		InputReader0 in = new InputReader0(inputStream);
		PrintWriter out = new PrintWriter(outputStream);
         */
        InputReader1 in = new InputReader1("maxflow.in");
        PrintWriter out = new PrintWriter("maxflow.out");
        Task solver = new Task();
        solver.solve(in, out);
        out.close();
    }
}

class Task {
    static Vector<Integer>[] Vertex;
    static int n, m, flow;
    static int[] Parent;
    static int[][] Capacity;
    static ArrayDeque<Integer> dq = new ArrayDeque<>();

    private static boolean BFS() {
        dq.add(1);
        while (!dq.isEmpty()) {
            int node = dq.poll();
            for (int it : Vertex[node])
                if (Parent[it] == 0 && Capacity[node][it] > 0) {
                    Parent[it] = node;
                    dq.add(it);
                }
        }
        return Parent[n] != 0;
    }

    public void solve(InputReader1 in, PrintWriter out) throws IOException {
        int i, x, y, z, c;
        n = in.nextInt();
        m = in.nextInt();
        Capacity = new int[n + 1][n + 1];
        Parent = new int[n + 1];
        Vertex = new Vector[n + 1];
        for (i = 1; i <= n; i++) {
            Vertex[i] = new Vector<>();
        }
        for (i = 1; i <= m; ++i) {
            x = in.nextInt();
            y = in.nextInt();
            c = in.nextInt();
            Vertex[x].add(y);
            Vertex[y].add(x);
            Capacity[x][y] = c;
        }
        while (BFS()) {
            for (int k : Vertex[n]) {
                z = Capacity[k][n];
                for (i = k; i != 1; i = Parent[i])
                    z = Math.min(z, Capacity[Parent[i]][i]);
                for (i = k; i != 1; i = Parent[i]) {
                    Capacity[Parent[i]][i] -= z;
                    Capacity[i][Parent[i]] += z;
                }
                flow += z;
                Capacity[n][k] += z;
                Capacity[k][n] -= z;
            }
            for (i = 1; i <= n; i++) {
                Parent[i] = 0;
            }
        }
        out.print(flow);
    }
}

class InputReader0 {
    public BufferedReader reader;
    public StringTokenizer tokenizer;

    public InputReader0(InputStream stream) {
        reader = new BufferedReader(new InputStreamReader(stream), 32768);
        tokenizer = null;
    }

    public String next() {
        while (tokenizer == null || !tokenizer.hasMoreTokens()) {
            try {
                tokenizer = new StringTokenizer(reader.readLine());
            } catch (IOException e) {
                throw new RuntimeException(e);
            }
        }
        return tokenizer.nextToken();
    }

    public int nextInt() {
        return Integer.parseInt(next());
    }

    public Long nextLong() {
        return Long.parseLong(next());
    }
}

class InputReader1 {
    BufferedReader bufferedReader;
    StringTokenizer st;

    InputReader1(String file) throws FileNotFoundException {
        bufferedReader = new BufferedReader(new FileReader(file));
    }

    String next() throws IOException {
        while (st == null || !st.hasMoreElements())
            st = new StringTokenizer(bufferedReader.readLine());

        return st.nextToken();
    }

    public int nextInt() throws IOException {
        return Integer.parseInt(next());
    }

    public Long nextLong() throws IOException {
        return Long.parseLong(next());
    }
}