#include <bits/stdc++.h>

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