#include <bits/stdc++.h>

using namespace std;
ifstream fin("maxflow.in");
ofstream fout("maxflow.out");
const int INF=1e9;
int n,m,S,D,ans,dist[1005],pt[1005];
int cap[1005][1005];
vector<int> muchii[1005];
int dfs(int nod,int c)
{
    if(c==0||nod==D)
        return c;
    while(pt[nod]<muchii[nod].size())
    {
        int i=muchii[nod][pt[nod]];
        pt[nod]++;
        if(dist[i]==dist[nod]+1&&cap[nod][i]>0)
        {
            int x=dfs(i,min(c,cap[nod][i]));
            if(x>0)
            {
                cap[nod][i]-=x;
                cap[i][nod]+=x;
                return x;
            }
        }
    }
    return 0;
}
bool flux()
{
    for(int i=1;i<=n;i++)
    {
        dist[i]=-1;
        pt[i]=0;
    }
    dist[S]=0;
    queue<int> coada;
    coada.push(S);
    while(!coada.empty())
    {
        int nod=coada.front();
        coada.pop();
        for(auto i:muchii[nod])
            if(cap[nod][i]>0&&dist[i]==-1)
            {
                dist[i]=dist[nod]+1;
                coada.push(i);
            }
    }
    if(dist[D]<0)
        return 0;
    int val=0;
    while(true)
    {
        int x=dfs(S,INF);
        if(x>0)
            val+=x;
        else
            break;
    }
    ans+=val;
    if(val==0)
        return 0;
    return 1;
}
int main()
{
    fin>>n>>m;
    S=1,D=n;
    for(int i=1;i<=m;i++)
    {
        int a,b,c;
        fin>>a>>b>>c;
        muchii[a].push_back(b);
        muchii[b].push_back(a);
        cap[a][b]=c;
    }
    while(flux());
    fout<<ans;
    return 0;
}