#include <bits/stdc++.h>

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