#include <bits/stdc++.h>
#define ll long long
#define all(a) (a).begin(), (a).end()
//#pragma GCC optimize("O3")
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define sz() size()
#define fr first
#define sc second
#define pb push_back
#define er erase
#define in insert
#define pi pair<int,int>
#define pii pair<pair<int,int>,int>
#define mp make_pair
//#define int long long
#define rc(s) return cout<<s,0
#define rcc(s) cout<<s,exit(0)
using namespace std;

const int inf=1e9;
const int mod=1e9+7;
const int modx=998244353;
const int per=666013;

int n,m,c[1005][1005],par[1005];
vector<int>nod[1005];

int bfs(int s,int t){
    for(int i=1;i<=n;i++) par[i]=0;
    queue<pair<int,int>>q;
    q.push({s,inf});
    while(!q.empty()){
        int curr=q.front().fr;
        int flow=q.front().sc;
        for(int next:nod[curr]){
            if(par[next]==0 && c[curr][next]){
                par[next]=curr;
                int tz=min(flow,c[curr][next]);
                if(next == t) return tz;
                else q.push({next,tz});
            }
        }
        q.pop();
    }
    return 0;
}

void flow(int s,int t,int &ans){
    int currflow=0;
    while(currflow=bfs(s,t)){
        ans+=currflow;
        int curr=t;
        while(curr!=s){
            int prev=par[curr];
            c[prev][curr]-=currflow;
            c[curr][prev]+=currflow;
            curr=prev;
        }
    }
}

int32_t main(){
	ios_base::sync_with_stdio(false);cin.tie(0);cerr.tie(0);cout.tie(0);
    srand(chrono::steady_clock::now().time_since_epoch().count());
    ifstream fin("maxflow.in");
    ofstream fout("maxflow.out");
    fin >> n >> m;
    for(int i=1;i<=m;i++){
        int x,y,z;
        fin >> x >> y >> z;
        nod[x].push_back(y);
        nod[y].push_back(x);
        c[x][y]=z;
    }
    int ans=0;
    flow(1,n,ans);
    fout << ans << '\n';
}