#include <bits/stdc++.h>

using namespace std;
ifstream in("maxflow.in");
ofstream out("maxflow.out");
const int N = 1005;
int Cap[N][N],Flow[N][N],from[N];
bool viz[N];
vector<int> v[N];
bool BFS(int sink)
{
    queue<int> q;
    q.push(1);
    for (int i = 1; i<=sink; i++)
        viz[i] = 0;
    while (!q.empty())
    {
        int now = q.front();
        viz[now] = 1;
        q.pop();
        if (now == sink)
            continue;
        for (auto it: v[now])
            if (Cap[now][it]-Flow[now][it]>0 && !viz[it])
            {
                viz[it] = 1;
                from[it] = now;
                q.push(it);
            }
    }
    return viz[sink];
}
int main()
{
    int n,m;
    in >> n >> m;
    for (int i = 1; i<=m; i++)
    {
        int x,y,c;
        in >> x >> y >> c;
        v[x].push_back(y);
        v[y].push_back(x);
        Cap[x][y]+=c;
    }
    int ans = 0;
    while(BFS(n))
    {
        for (auto last: v[n])
        {
            if (from[last] && Cap[last][n]-Flow[last][n]>0)
            {
                int flowmin = INT_MAX;
                from[n] = last;
                for (int i = n; i!=1; i = from[i])
                    flowmin = min(flowmin,Cap[from[i]][i]-Flow[from[i]][i]);
                if (flowmin)
                {
                    ans+=flowmin;
                    for (int i = n; i!=1; i = from[i])
                    {
                        Flow[from[i]][i]+=flowmin;
                        Flow[i][from[i]]-=flowmin;
                    }
                }
            }
        }
    }
    out << ans;
}