#include <algorithm>
#include <iostream>
#include <fstream>
#include <climits>
#include <vector>
#include <deque>
#include <queue>
#include <stack>
#include <map>
#include <set>

#include <iomanip>
#include <cassert>

#include <random>
#include <chrono>

// #pragma GCC optimize("O3,unroll-loops")
// #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")

using ull = unsigned long long;
//using ll = long long;

//#define int __int128
//#define int ll
#define pii pair <int, int>
#define all(a) (a).begin(), (a).end()
#define fr first
#define sc second
#define pb push_back
#define lb lower_bound
#define ub upper_bound

#define vt vector
#define FOR(a, b) for(int i = (a); i <= (b); i++)
#define FORr(a, b) for(int i = (a); i >= (b); i--)
#define sz(x) (int)(x).size()

#define YES cout << "YES\n"
#define NO cout << "NO\n"

using namespace std;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int rangerng(int l, int r){
    return uniform_int_distribution<>(l, r)(rng);
}

string filename = "maxflow";
ifstream fin(filename + ".in");
ofstream fout(filename + ".out");

////////////////////////////////////////////////////////////////////////////////////

const int NMAX = 1000;
const int INF = 1e9;

int n, m;
vt <int> adj[NMAX + 1];
int f[NMAX + 1][NMAX + 1];

bool viz[NMAX + 1];
int par[NMAX + 1];

bool BFS(){
    for(int i = 1; i <= n; i++){
        viz[i] = par[i] = 0;
    }

    queue <int> Q;
    Q.push(1);
    viz[1] = 1;

    while(!Q.empty()){
        int node = Q.front();
        Q.pop();

        if(node == n){
            return 1;
        }

        for(int vec : adj[node]){
            if(f[node][vec] > 0 && !viz[vec]){
                viz[vec] = 1;
                par[vec] = node;
                Q.push(vec);
            }
        }   
    }

    return 0;
}

void solve(){
    fin >> n >> m;

    for(int i = 1; i <= m; i++){
        int a, b, c;
        fin >> a >> b >> c;
        adj[a].pb(b);
        adj[b].pb(a);
        f[a][b] = c;
    }

    int ans = 0;
    while(BFS()){
        for(int vec : adj[n]){
            if(f[vec][n] == 0 || !viz[vec]){
                continue;
            }
            int node = n;
            par[n] = vec;

            int mini = INF;
            while(node != 1){
                mini = min(mini, f[par[node]][node]);
                node = par[node];
            }

            ans += mini;
            node = n;
            while(node != 1){
                f[par[node]][node] -= mini;
                f[node][par[node]] += mini;
                node = par[node];
            }        
        }
    }

    fout << ans << '\n';
}   


signed main(){

    ios_base::sync_with_stdio(false);
    cin.tie(0);

    int T;
    //fin >> T;

    T = 1;

    while(T--){
        solve();
    }

    return 0;
}

/*
*/