#include <fstream>
#include <vector>
using namespace std;
ifstream fin("maxflow.in");
ofstream fout("maxflow.out");
const int NMax = 1000;
const int oo = 2000000000;
vector <int> G[NMax + 5];
int C[NMax + 5][NMax + 5],F[NMax + 5][NMax + 5];
int N,M,Flow;
int Q[NMax + 5], Use[NMax + 5],TT[NMax + 5];
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);
        G[y].push_back(x);
        C[x][y] = z;
    }
}

int BFS()
{
    for(int i = 1; i <= N; ++i)
        Use[i] = TT [i] = 0;
    Q[1] = Q[0] = 1;
    for(int i = 1; i <= Q[0]; ++i)
    {
        int Nod = Q[i];
        if(Nod == N) continue;
        for(int i = 0; i <(int)G[Nod].size(); ++i)
        {
            int Vecin = G[Nod][i];
            if(Use[Vecin] || C[Nod][Vecin] == F[Nod][Vecin]) continue;
            TT[Vecin] = Nod;
            Q[++Q[0]] = Vecin;
            Use[Vecin] = 1;
        }
    }
    return Use[N];
}

void Print()
{
    fout << Flow << "\n";
}

int main()
{
    Read();
    while(BFS())
    {
        for(int i = 0; i <(int)G[N].size(); ++i)
        {
            TT[N] = G[N][i];
            if(F[TT[N]][N] == C[TT[N]][N] || !Use[TT[N]]) continue;
            int Fmin = oo;
            for(int i = N; i != 1; i= TT[i])
            {
                Fmin = min(Fmin,C[TT[i]][i] - F[TT[i]][i]);
            }
            for(int i = N; i != 1; i= TT[i])
            {
                F[TT[i]][i] += Fmin;
                F[i][TT[i]] -= Fmin;
            }
            Flow += Fmin;
        }
    }
    Print();
    return 0;
}