// Ford-Falkerson
#include <bits/stdc++.h>

using namespace std;

const int MAXN = 10;
int c[MAXN][MAXN], f[MAXN][MAXN];
vector<int> from;
int n, k;

void dfs(int v, int p = -1) {
    from[v] = p;
    if (v == n - 1) return;
    for (int to = 0; to < n; to++) {
        if (from[to] == -1 && c[v][to] - f[v][to] > 0) {
            dfs(to, v);
        }
    }
}

int main() {
    cin >> n >> k;
    int u, v, temp;
    for (int i = 0; i < n; i++) {
        cin >> u >> v >> temp;
        u--; v--;
        c[u][v] = temp;
    }
    while (true) {
        from.assign(n, -1);
        dfs(0);
        if (from[n - 1] == -1) break;

        int mn = INT_MAX;
        int now = n - 1;
        while (now != 0) {
            int pred = from[now];
            mn = min(mn, c[pred][now] - f[pred][now]);
            now = pred;
        }

        now = n - 1;
        while (now != 0) {
            int pred = from[now];
            f[pred][now] += mn;
            f[now][pred] -= mn;
            now = pred;
        }
    }
    int res = 0;
    for (int i = 0; i < n; i++) {
        if (c[i][n - 1] > 0) res += f[i][n - 1];
    }
    cout << res;
    return 0;
}