#include <bits/stdc++.h>

using namespace std;

ifstream fin("maxflow.in");
ofstream fout("maxflow.out");

const int INF=1e9+7;
int n,m,f;
int cap[1005][1005];
int flow[1005][1005];
vector<int> vecini[1005];
bool vizitat[1005];
int tata[1005];

int bfs()
{
    memset(vizitat,0,sizeof vizitat);
    queue<int> q;
    q.push(1);
    while(!q.empty())
    {
        int i=q.front();
        q.pop();
        for(auto pi: vecini[i])
        {
            if(flow[i][pi]<cap[i][pi] && !vizitat[pi])
            {
                vizitat[pi]=1;
                q.push(pi);
                tata[pi]=i;
                if(pi==n) return 1;
            }
        }
    }
    return 0;
}

int main()
{
    fin>>n>>m;
    for(int i=0; i<m; i++)
    {
        int a,b,c;
        fin>>a>>b>>c;
        vecini[a].push_back(b);
        vecini[b].push_back(a);
        cap[a][b]+=c;
    }
    int flowmin=INF;
    while(bfs())
    {
        flowmin=INF;
        for(int nod=n; nod!=1; nod=tata[nod])
            flowmin=min(flowmin, cap[tata[nod]][nod]-flow[tata[nod]][nod]);
        for(int nod=n; nod!=1; nod=tata[nod])
        {
            flow[tata[nod]][nod]+=flowmin;
            flow[nod][tata[nod]]-=flowmin;
        }
        f+=flowmin;
    }
    fout<<f;
    return 0;
}