#include <iostream>
#include <queue>

#define N 1002
using namespace std;

typedef pair<int, int> PII;

int n, m;
int S, T, dist[N], F;
queue<int> que;
vector<PII> E;
vector<int> G[N], G2[N];

void CalcMinDists(){

    while(!que.empty()) que.pop();

    for(int i = 1; i <= n; i ++)
        G2[i].clear(), dist[i] = 0;

    for(que.push(S), dist[S] = 1; !que.empty(); que.pop()){

        int node = que.front();
        if(node == T) break;

        for(auto e : G[node])
            if(E[e].second){

                if(dist[E[e].first] == 0)
                    que.push(E[e].first), dist[E[e].first] = dist[node] + 1;

                if(dist[E[e].first] == dist[node] + 1)
                    G2[node].push_back(e);
            }
    }
}

int BuildFlow(int node, int c){

    if(node == T || c == 0) { F += c; return c; }

    int f = 0;
    for(auto e : G2[node])
        if(E[e].second){

            int auxF = BuildFlow(E[e].first, min(c - f, E[e].second));

            E[e].second -= auxF;
            E[e ^ 1].second += auxF;
            f += auxF;
        }

    return f;
}

int main(){

    cin >> n >> m; S = 1; T = n;
    for(int i = 1; i <= m; i ++){

        int a, b, c;
        cin >> a >> b >> c;

        G[a].push_back(E.size());
        E.push_back({b, c});

        G[b].push_back(E.size());
        E.push_back({a, 0});        
    }

    do{ CalcMinDists(); } while(BuildFlow(S, 0x3f3f3f3f));

    cout << F;
    return 0;   
}