#include <bits/stdc++.h> //Andrei Alexandru a.k.a Sho
#define ll int
#define double long double
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#define aint(a) (a).begin(), (a).end()
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define pi pair
#define rc(s) return cout<<s,0
#define endl '\n'
#define mod 1000000007
#define PI 3.14159265359
#define INF 1000000005
#define LINF 1000000000000000005ll
#define CODE_START  ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
ll n,m,flow,parent[1005],c[1005][1005],f[1005][1005],viz[1005],cd[1005];
vector<ll>g[1005];
ll BFS(){
cd[0]=1;
cd[1]=1;
memset(viz,0,sizeof(viz));
viz[1]=1;
for(ll i=1;i<=cd[0];i++)
{
    ll node=cd[i];
    if(node==n){
        continue;
    }
    for(auto it : g[node]){
        if(c[node][it]==f[node][it]||viz[it]){
            continue;
        }
        viz[it]=1;
        cd[++cd[0]]=it;
        parent[it]=node;
    }
}
return viz[n];
}
int32_t main(){
CODE_START;
ifstream cin("maxflow.in");
ofstream cout("maxflow.out");
cin>>n>>m;
for(ll i=1;i<=m;i++)
{
    ll x,y,z;
    cin>>x>>y>>z;
    c[x][y]+=z;
    g[x].pb(y);
    g[y].pb(x);
}
ll fmin=0;
for(flow=0;BFS();){
for(auto it : g[n]){
    if(f[it][n]==c[it][n]||viz[it]==0){
        continue;
    }
    parent[n]=it;
}
fmin=INF;
for(ll node=n;node!=1;node=parent[node]){
fmin=min(fmin,c[parent[node]][node]-f[parent[node]][node]);
}
if(fmin==0){
    continue;
}
for(ll node=n;node!=1;node=parent[node]){
    f[parent[node]][node]+=fmin;
    f[node][parent[node]]-=fmin;
}
flow+=fmin;
}
cout<<flow<<endl;
}