#include<fstream>
#include<vector>
#include<queue>
#include<cstring>
#define NMAX 1005
using namespace std;
ifstream _cin("maxflow.in");
ofstream _cout("maxflow.out");
vector<int> G[NMAX];
queue<int> q;
int n, m, x, y, z, source, dest;
int C[NMAX][NMAX];
int F[NMAX][NMAX];
int nod, fiu, minim, sol_flow;
int T[NMAX];
bool u[NMAX];
void reinit()
{
    memset(u, 0, sizeof(u));
}

bool bfs()
{
    reinit();

    q.push(source);
    u[source] = 1;

    while(!q.empty())
    {
        nod = q.front();
        q.pop();

        for(int i = 0; i < G[nod].size(); i++)
        {
            fiu = G[nod][i];
            if(u[fiu] == 0 && C[nod][fiu] - F[nod][fiu] > 0)
            {
                q.push(fiu);
                u[fiu] = 1;

                T[fiu] = nod;
            }
        }
    }

    return u[dest] == 1;
}

void flow_update(int tata, int nod)
{
    F[tata][nod] += minim;
    F[nod][tata] -= minim;
}

void _flow()
{
    while(bfs())
    {
        for(int i = 0; i < G[dest].size(); i++)
        {
            int nod = G[dest][i];
            if(u[nod] == 1)
            {
                minim = C[nod][dest] - F[nod][dest];
                for(; T[nod] > 0 && minim != 0; nod = T[nod])
                {
                    minim = min(C[T[nod]][nod] - F[T[nod]][nod], minim);
                }

                if(minim != 0)
                {
                    sol_flow += minim;

                    nod = G[dest][i];
                    flow_update(nod, dest);
                    for(; T[nod] > 0; nod = T[nod])
                    {
                        flow_update(T[nod], nod);
                    }
                }
            }
        }
    }
}

int main()
{
    _cin >> n >> m;
    for(int i = 1; i <= m; i++)
    {
        _cin >> x >> y >> z;
        G[x].push_back(y);
        C[x][y] = z;

        G[y].push_back(x);
    }

    source = 1; dest = n;
    _flow();

    _cout << sol_flow;

    return 0;
}