#include <fstream>
#include <vector>
#include <queue>
#include <cstring>
#define NMax 1005
#define oo 1000000000
using namespace std;

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

vector <int> G[NMax];
int N,M;
int C[NMax][NMax],F[NMax][NMax];
int TT[NMax],Use[NMax];

queue <int> Q;

void Read()
{
    fin>>N>>M;
    for(int i = 1; i<=M; i++)
        {
            int x,y,z;
            fin>>x>>y>>z;
            G[x].push_back(y);
            C[x][y] = z;
            G[y].push_back(x);
        }
}

int BFS()
{
    memset(Use,0,sizeof(Use));
    memset(TT,0,sizeof(TT));
    Q.push(1);Use[1] = 1;
    while(!Q.empty())
    {
        int Nod = Q.front(); Q.pop();
        for(int i = 0; i < (int) G[Nod].size(); i++)
            {
                int Vecin = G[Nod][i];
                if(C[Nod][Vecin]==F[Nod][Vecin]) continue;
                if(!Use[Vecin])
                    {
                        Q.push(Vecin); Use[Vecin] = 1;
                        TT[Vecin] = Nod ;
                    }
            }
    }
    return Use[N];
}

int main()
{
    Read();

    int Flow = 0;

    while( BFS() )
    {
        int Fmin = oo;
        for(int Nod = N; Nod!=1; Nod = TT[Nod])
            {
                int Tata = TT[Nod];
                Fmin = min(Fmin,C[Tata][Nod]-F[Tata][Nod]);
            }

        Flow+=Fmin;

        for(int Nod = N; Nod!=1; Nod = TT[Nod])
            {
                int Tata = TT[Nod];
                F[Tata][Nod] += Fmin;
                F[Nod][Tata] -= Fmin;
            }
    }

    fout<<Flow<<"\n";

    return 0;
}