#include<bits/stdc++.h>
using namespace std;
#define INIT  ios_base :: sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define mp make_pair
#define pb push_back
#define ft first
#define sc second
#define ll long long
#define pii pair<int, int>
#define count_bits __builtin_popcount
//#define int ll

int t, n, m, k, a[300010], q, l, r;

vector<int> g[1010];
int c[5010][5010];
int f[5010][5010];


bool v[5010];
int p[5010];
int fat[5010];

int dijkstra(int s, int t){

for(int i=1; i<=n; i++){
    v[i]=false;
}

multiset<pii> ms;
ms.insert({1e9, s});
fat[s]=1e9;

while(!ms.empty()){
    auto it=ms.end(); it--;
    int nod=it->sc;
    ms.erase(it);
    v[nod]=true;
    if(nod==t){break;}

    for(int u:g[nod]){
        if(v[u]){continue;}
        auto it=ms.find({fat[u], u});

        if(it==ms.end()){
            fat[u]=min(fat[nod], c[nod][u]-f[nod][u]);
            ms.insert({fat[u], u });
            p[u]=nod;
        }
        else{
            if( min(fat[nod], c[nod][u]-f[nod][u])>fat[u]  ){
                fat[u]=min(fat[nod], c[nod][u]-f[nod][u]);
                ms.erase(it);
                ms.insert({fat[u], u});
                p[u]=nod;
            }
        }
        //cout<<fat[u]<<" "<<u<<"x\n"<<flush;
    }


}
int cr=t;

while(cr!=0){
    f[p[cr] ][cr]+=fat[t];
    f[cr ][p[cr] ]-=fat[t];
    cr=p[cr];
}



return fat[t];
}



int32_t main(){
INIT

freopen("maxflow.in", "r", stdin);
freopen("maxflow.out", "w", stdout);

cin>>n>>m;


for(int i=1; i<=m; i++){
    int u, v;
    cin>>u>>v;
    cin>>c[u][v];
    g[u].pb(v);
    g[v].pb(u);
}



int res=0;

while(true){
    int x=dijkstra(1, n);
    if(x==0){break;}
    //cout<<x<<flush<<"\n";
    res+=x;
}




cout<<res;

return 0;
}