#include <bits/stdc++.h>
#define ll long long

using namespace std;
ifstream in("maxflow.in");
ofstream out("maxflow.out");

const int NMAX = 1005;

struct Edge {
    int to, flow, cap, rev;
};

int c[NMAX][NMAX], rem[NMAX], dist[NMAX], src, dest, n;
vector<Edge> g[NMAX];

void addEdge(int i, int j) {
    Edge a = {j, 0, c[i][j], g[j].size()};
    Edge b = {i, 0, c[j][i], g[i].size()};
    g[i].push_back(a);
    g[j].push_back(b);
}

bool bfs() {
    for(int i = 1; i <= n; i ++)
        dist[i] = -1;
    dist[src] = 0;
    queue<int> q;
    q.push(src);
    while(q.size()) {
        int from = q.front();
        q.pop();
        for(auto it : g[from]) {
            if(it.flow < it.cap && dist[it.to] == -1) {
                dist[it.to] = dist[from] + 1;
                q.push(it.to);
            }
        }
    }
    return (dist[dest] != -1);
}

int dfs(int from, int deltaflow) {
    if(from == dest)
        return deltaflow;
    for(int &i = rem[from]; i < g[from].size(); i ++) {
        Edge &node = g[from][i];
        if(dist[node.to] == dist[from] + 1 && node.flow < node.cap) {
            int addflow = dfs(node.to, min(deltaflow, node.cap - node.flow));
            if(addflow) {
                Edge &rev = g[node.to][node.rev];
                node.flow += addflow;
                rev.flow -= addflow;
                return addflow;
            }
        }
    }
    return 0;
}

int dinic() {
    int maxflow = 0;
    while(bfs()) {
        for(int i = 1; i <= n; i ++)
            rem[i] = 0;
        int aux = dfs(src, INT_MAX);
        while(aux) {
            maxflow += aux;
            aux = dfs(src, INT_MAX);
        }
    }
    return maxflow;
}

int main() {
    int m;
    in >> n >> m;
    src = 1;
    dest = n;
    for(int i = 1; i <= m; i ++) {
        int x, y, z;
        in >> x >> y >> z;
        c[x][y] = z;
    }
    for(int i = 1; i <= n; i ++)
        for(int j = i + 1; j <= n; j ++)
            if(c[i][j] || c[j][i])
                addEdge(i, j);
    out << dinic();

    return 0;
}