#include <fstream>
#include <queue>
#include <vector>
#define nmax 1024
#define oo (1<<30)
using namespace std;

ifstream in("maxflow.in");
ofstream out("maxflow.out");

inline int _min(int a,int b){if(a<b) return a;return b;}

int C[nmax][nmax];
int T[nmax];
int N,M;

vector<int> V[nmax];
queue<int> Q;

int BF()
{
    int i,x,y;
    while(!Q.empty())Q.pop();
    for(i=1;i<=N;i++)T[i]=0;
    Q.push(1);
    while(!Q.empty())
    {
        x = Q.front();
        Q.pop();
        for(i=0;i<V[x].size();++i)
        {
            y = V[x][i];
            if(C[x][y]&&!T[y])
            {
                if(y==N)
                    return 1;
                T[y]=x;
                Q.push(y);
            }
        }
    }
    return 0;
}

int main()
{
    int x,y,c,muchie_minima,flow=0,i;
    in>>N>>M;
    while(M--)
    {
        in>>x>>y>>c;
        C[x][y]+=c;
        V[x].push_back(y);
        V[y].push_back(x);
    }
    in.close();
    while(BF())
    {
        for(i=0;i<V[N].size();i++)
        {
            x = V[N][i];
            if(!C[x][N]||!T[x])continue;
            T[N] = x;
            x = N;//determin muchia minima
            muchie_minima = oo;
            while(x!=1)
                muchie_minima=_min(muchie_minima,C[T[x]][x]),x=T[x];
            if(!muchie_minima)continue;
            x = N;//actualizez costurile
            while(x!=1)
                C[T[x]][x]-=muchie_minima,C[x][T[x]]+=muchie_minima,x=T[x];
            flow+=muchie_minima;

        }
    }
    out<<flow<<'\n';
    out.close();
    return 0;
}