#include<cstdio>
#include<vector>
#include<queue>

using namespace std;

int n,m;
int x,y,z;
vector<int> con[1001];
queue<int> q;
int flux[1001][1001];
int cap[1001][1001];
int viz[1001];
int tata[1001];

int bfs()
{
    for(int i=1;i<=n;i++)
    {
        viz[i]=0;
    }
    q.push(1);
    viz[1]=1;
    int curr,next;
    while(!q.empty())
    {
        curr=q.front();
        for(vector<int>::iterator it=con[curr].begin();it!=con[curr].end();it++)
        {
            next=*it;
            if(flux[curr][next]<cap[curr][next]&&viz[next]==0)
            {
                viz[next]=1;
                tata[next]=curr;
                q.push(next);
            }
        }
        q.pop();
    }
    return viz[n];
}

int main()
{
    freopen("maxflow.in","r",stdin);
    freopen("maxflow.out","w",stdout);

    scanf("%d %d",&n,&m);
    for(int i=1;i<=m;i++)
    {
        scanf("%d %d %d",&x,&y,&z);
        con[x].push_back(y);
        con[y].push_back(x);
        cap[x][y]=z;
    }

    int maxflow=0;
    while(bfs())
    {
        for(vector<int>::iterator it=con[n].begin();it!=con[n].end();it++)
        {
            int curr=*it;
            if(flux[curr][n]<cap[curr][n]&&viz[curr]==1)
            {
                int mf=cap[curr][n]-flux[curr][curr];
                //curr=tata[curr];

                while(tata[curr]!=0)
                {
                    mf=min(mf,cap[tata[curr]][curr]-flux[tata[curr]][curr]);
                    curr=tata[curr];
                }

                maxflow+=mf;
                curr=*it;
                flux[curr][n]+=mf;
                flux[n][curr]-=mf;
                //curr=tata[curr];

                while(tata[curr]!=0)
                {
                    flux[tata[curr]][curr]+=mf;
                    flux[curr][tata[curr]]-=mf;
                    curr=tata[curr];
                }
            }

        }
    }
    printf("%d",maxflow);
}