#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);
    while(!q.empty())
    {
        int curr=q.back();
        viz[curr]=1;
        for(vector<int>::iterator it=con[curr].begin();it!=con[curr].end();it++)
        {
            int 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;
            int next=n;
            int mf=cap[curr][next]-flux[curr][next];
            next=curr;
            curr=tata[curr];

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

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

            while(curr!=1)
            {
                next=curr;
                curr=tata[curr];
                flux[curr][next]+=mf;
                flux[next][curr]-=mf;
            }
        }
    }
    printf("%d",maxflow);
}