#include <fstream>
#include <vector>
#include <bitset>
#include <queue>
#include <algorithm>
#include <utility>
#include <cstring>
#include <string>
#include <stack>
#include <deque>
#include <iomanip>
#include <set>
#include <map>
#include <cassert>
#include <ctime>
#include <list>
#include <iomanip>

using namespace std;

string file = "maxflow";

ifstream cin( (file + ".in").c_str() );
ofstream cout( (file + ".out").c_str() );

const int MAXN = 1005;
const int oo = 0x3f3f3f3f;

typedef vector<int> Graph[MAXN];
typedef vector<int> :: iterator It;

const inline int min(const int &a, const int &b) { if( a > b ) return b;   return a; }
const inline int max(const int &a, const int &b) { if( a < b ) return b;   return a; }
const inline void Get_min(int &a, const int b)    { if( a > b ) a = b; }
const inline void Get_max(int &a, const int b)    { if( a < b ) a = b; }

struct ClassComp {
    inline bool operator () (const int &a, const int &b) const {
        return a > b;
    }
};

int N, M, C[MAXN][MAXN], F[MAXN][MAXN], maxFlow, Father[MAXN];
Graph G;
queue<int> Q;
bitset<MAXN> Vis;

inline bool BFs() {
    Q.push(1);
    Vis.reset();
    Vis[1] = true;
    while(!Q.empty()) {
        int Node = Q.front();
        Q.pop();
        if(Node == N)
            continue;
        for(It it = G[Node].begin(), fin = G[Node].end(); it != fin ; ++ it) {
            int actNode = *it;
            if(C[Node][actNode] == F[Node][actNode] || Vis[actNode])
                continue;
            Vis[actNode] = true;
            Father[actNode] = Node;
            Q.push(actNode);
        }
    }
    return Vis[N];
}

int main() {
    cin >> N >> M;
    for(int i = 1 ; i <= M ; ++ i) {
        int x, y, z;
        cin >> x >> y >> z;
        C[x][y] += z; /// capacitatea muchiei
        G[x].push_back(y);
        G[y].push_back(x);
    }
    for( ; BFs() ; ) {
        for(It it = G[N].begin(), fin = G[N].end(); it != fin ; ++ it) {
            int actNode = *it;
            if(C[actNode][N] == F[actNode][N] || !Vis[actNode]) ///asta denota faptul ca ...
                continue;
            Father[N] = actNode;
            int minFlow = oo;
            for(int i = N ; i != 1 ; i = Father[i])
                minFlow = min(minFlow, C[ Father[i] ][i] - F[ Father[i] ][i]);
            if(!minFlow)
                continue;
            for(int i = N ; i != 1 ; i = Father[i]) {
                F[Father[i]][i] += minFlow;
                F[i][Father[i]] -= minFlow;
            }
            maxFlow += minFlow;
        }
    }
    cout << maxFlow << '\n';
    cin.close();
    cout.close();
    return 0;
}