#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()
{
    queue<int> q;
    q.push(1);
    memset(vizitat,0,sizeof vizitat);
    vizitat[1]=1;
    while(!q.empty())
    {
        int i=q.front();
        q.pop();
        if(i!=n)
        {
            for(auto pi: vecini[i])
            {
                if(flow[i][pi]==cap[i][pi] || vizitat[pi]) continue;
                q.push(pi);
                tata[pi]=i;
                vizitat[pi]=1;
            }
        }
    }
    return vizitat[n];
}

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())
    {
        for(int i=0; i<vecini[n].size(); i++)
        {
            int vn=vecini[n][i];
            if(flow[vn][n]==cap[vn][n] || !vizitat[vn]) continue;
            tata[n]=vn;

            flowmin=INF;
            for(int nod=n; nod!=1; nod=tata[nod])
            {
                flowmin=min(flowmin,cap[tata[nod]][nod]-flow[tata[nod]][nod]);
            }
            if(flowmin==0) continue;
            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;
}