#include<bits/stdc++.h>
#define pb push_back
#define ft first
#define maxn 1000
#define sd second
#define inf 0x3f3f3f3f
using namespace std;
vector<int>v[maxn];
queue<int>q;
int c[maxn][maxn],viz[maxn],tt[maxn],n,m,d,s,flux,Cost;

void solve(){
        viz[n]=1;
        while(viz[n]){
                q.push(1);
                memset(viz,0,sizeof(viz));
                viz[1]=1;
                while(!q.empty()){
                        int nod=q.front();
                        q.pop();
                        if(nod==n)
                                continue;
                        for(int i=0; i<v[nod].size(); i++){
                                int dest=v[nod][i];
                                if(c[nod][dest]==0||viz[dest])
                                        continue;
                                tt[dest]=nod;
                                viz[dest]=1;
                                q.push(dest);
                        }
                }
                if(viz[n]){
                                flux=inf;
                                if(!viz[tt[n]] || c[tt[n]][n]==0)
                                        continue;
                                for(int wh=n; wh!=1; wh=tt[wh])
                                        flux=min(flux, c[tt[wh]][wh]);
                                for(int wh=n; wh!=1; wh=tt[wh])
                                        c[tt[wh]][wh]-=flux,
                                        c[wh][tt[wh]]+=flux;
                                Cost+=flux;
                        }
        }
        cout<<Cost;
}


int main(){
        freopen("maxflow.in","r",stdin);
        freopen("maxflow.out", "w", stdout);
        ios_base::sync_with_stdio(0);
        cin.tie(0);
        cin>>n>>m;
        int x,y,w;
        while(m--){
                cin>>x>>y>>w;
                v[x].pb(y); v[y].pb(x);
                c[x][y]=w;
        }
        solve();
        return 0;
}