#include <bits/stdc++.h>

#define NM 1002

using namespace std;

vector <int> G[NM];
queue <int> q;

int n, m, fm;
int C[NM][NM], F[NM][NM];
int T[NM];

bool bfs(int st)
{
    for(int i = 1; i <= n; i++)
        T[i] = 0;
    q.push(st);
    T[st] = st;
    while(!q.empty())
    {
        int nd = q.front();
        q.pop();
        for(auto i : G[nd])
            if(T[i] == 0 && F[nd][i] < C[nd][i])
            {
                T[i] = nd;
                q.push(i);
            }
    }
    return (T[n] > 0);
}

int main()
{
    ifstream fin ("maxflow.in");
    ofstream fout ("maxflow.out");
    fin >> n >> m;
    for(int i = 1; i <= m; i++)
    {
        int a, b, c;
        fin >> a >> b >> c;
        G[a].push_back(b);
        G[b].push_back(a);
        C[a][b] = c;
    }
    while(bfs(1))
    {
        int mi = -1;
        for(int i = n; i > 1; i = T[i])
        {
            if(C[T[i]][i] - F[T[i]][i] < mi || mi == -1)
                mi = C[T[i]][i] - F[T[i]][i];
        }
        for(int i = n; i > 1; i = T[i])
        {
            F[T[i]][i] += mi;
            F[i][T[i]] -= mi;
        }
        fm += mi;
    }
    fout << fm << "\n";
    return 0;
}