#include <fstream>
#include <vector>
#include <queue>
#include <cstring>
#define NMax 1005
using namespace std;
ifstream fin("maxflow.in");
ofstream fout("maxflow.out");

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

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

int BFS()
{
    memset(Use,0,sizeof(Use));
    Q.push(1); Use[1] = 1;

    while(!Q.empty())
    {
        int Node = Q. front(); Q. pop();

        if(Node == N) continue;

        for(unsigned int i = 0; i < G[Node].size(); ++i)
        {
            int Neighbour = G[Node][i];

            if(!Use[Neighbour] && C[Node][Neighbour]-F[Node][Neighbour]>0)
            {
                TT[Neighbour] = Node;
                Q.push(Neighbour);
                Use[Neighbour] = 1;
            }
        }
    }

return Use[N];

}

void Solve()
{
    while(BFS())
    {

        for(unsigned int k = 0; k<G[N].size(); ++k)
        {

        int Vecin = G[N][k];

        if(!Use[Vecin] || C[Vecin][N]-F[Vecin][N] == 0) continue;

        TT[N] = Vecin;

        int Fmin = 120000;

        for(int i = N ; i != 1 ; i = TT[i])
            Fmin = min(Fmin,C[TT[i]][i]-F[TT[i]][i]);

        MaxFlow += Fmin;

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

        }
    }
}

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

int main()
{
    Read();
    Solve();
    Print();
    return 0;
}