#include <bits/stdc++.h>
#define dim 1010
using namespace std;
ifstream fin("maxflow.in");
ofstream fout("maxflow.out");
deque <int> d;
bitset<dim> fr;
vector <int> L[dim];
int C[dim][dim],F[dim][dim];
int  n,x,y,z,minim,t[dim],m,i,flux;
bool bfs(){
fr.reset();
d.push_back(1);
fr[1]=1;
int nod;
int gasit=0,i;
while(!d.empty()){
    nod=d.front();
    d.pop_front();
    for(i=0;i<L[nod].size();i++){
        int vecin=L[nod][i];
        if(fr[vecin]==0&&C[nod][vecin]-F[nod][vecin]>0){
            fr[vecin]=1;
            d.push_back(vecin);
            if(vecin==n)
                gasit=1;
                t[vecin]=nod;
        }
    }
}
return gasit;
}
int main()
{
    fin>>n>>m;
    for(i=1; i<=m; i++)
    {
        fin>>x>>y>>z;
        L[x].push_back(y);
        L[y].push_back(x);
        C[x][y]=z;
    }
    while(bfs())
    {
        for(auto it:L[n])
        {
            minim=C[it][n]-F[it][n];
            if(minim>0&&fr[it]==1){
            int aux=it;
            while(t[aux]!=0)
            {
                minim=min(minim,C[t[aux]][aux]-F[t[aux]][aux]);
                aux=t[aux];
            }
            aux=it;
            F[it][n]+=minim;
            flux+=minim;
            while(t[aux]!=0)
            {
                F[t[aux]][aux]+=minim;
                aux=t[aux];
            }
            }
        }
    }
    fout<<flux;
}