#include<fstream>
#include<algorithm>
#include<vector>
#include<queue>
#define INF 2000000000
using namespace std;
ifstream f("maxflow.in");
ofstream g("maxflow.out");
vector<int>a[1002];
int n,s,d,sol,r[1002][1002],niv[1002],last[1002];
bool viz[1002];
queue<int>q;

inline bool bfs()
{
    int i,x,l;
    for(i=1;i<=n;i++)
        viz[i]=0,niv[i]=0;
    q.push(s);
    viz[s]=1;
    niv[s]=0;
    while(!q.empty())
    {
        x=q.front();
        q.pop();
        l=a[x].size();
        for(i=0;i<l;i++)
        if(viz[a[x][i]]==0&&r[x][a[x][i]]>0)
        {
            viz[a[x][i]]=1;
            niv[a[x][i]]=niv[x]+1;
            q.push(a[x][i]);
        }
    }
    return viz[d];
}

inline int dfs(int x,int rez)
{
    if(x==d)
        return rez;
    else
    {
        int i,l=a[x].size(),flow;
        for(i=last[x];i<l;i++)
        if(viz[a[x][i]]==0&&r[x][a[x][i]]>0&&niv[a[x][i]]==niv[x]+1)
        {
            flow=dfs(a[x][i],min(rez,r[x][a[x][i]]));
            if(flow>0)
            {
                r[x][a[x][i]]-=flow;
                r[a[x][i]][x]+=flow;
                last[x]=i;
                return flow;
            }
            else
                viz[a[x][i]]=1;
        }
        return 0;
    }
}

inline void flux_maxim()
{
    int i,x;
    while(bfs()!=0)
    {
        for(i=1;i<=n;i++)
            viz[i]=0;
        x=dfs(s,INF);
        while(x!=0)
        {
            sol+=x;
            for(i=1;i<=n;i++)
                viz[i]=0;
            x=dfs(s,INF);
        }
    }
}

int main()
{
    int m,i,x,y,c;
    f>>n>>m;
    for(i=1;i<=m;i++)
    {
        f>>x>>y>>c;
        a[x].push_back(y);
        a[y].push_back(x);
        r[x][y]=c;
    }
    s=1;
    d=n;
    flux_maxim();
    g<<sol;
    return 0;
}