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

using namespace std;

queue<int> q;
int sursa,dest,cap_flow[1010][1010],tata[1010],n;
char vaz[1010];
vector<int> v[1010];

int bfs()
{
    for(int i=1;i<=n;i++) vaz[i]=0;
    q.push(sursa);
    vaz[sursa]=1;
    while(!q.empty())
    {
        int nod=q.front();
        q.pop();
        for(int i=0;i<v[nod].size();i++)
        {
            int vec=v[nod][i];
            if(vaz[vec]==1 or cap_flow[nod][vec]==0) continue;
            tata[vec]=nod;
            vaz[vec]=1;
            if(vec!=dest) q.push(vec);
        }
    }
    return vaz[dest];
}

int main()
{
    freopen("maxflow.in","r",stdin);
    freopen("maxflow.out","w",stdout);
    int m,x,y,z,flow=0;
    scanf("%d%d",&n,&m);
    for(int i=1;i<=m;i++)
    {
        scanf("%d%d%d",&x,&y,&z);
        v[x].push_back(y);
        v[y].push_back(x);
        cap_flow[x][y]=z;
    }
    sursa=1;dest=n;
    while(bfs())
    {
        for(int i=0;i<v[dest].size();i++)
        {
            int vec=v[dest][i];
            if(vaz[vec]==0 or cap_flow[vec][dest]==0) continue;
            tata[dest]=vec;
            int s=1e9;
            for(int nod=dest;nod!=sursa;nod=tata[nod]) s=min(s,cap_flow[tata[nod]][nod]);
            for(int nod=dest;nod!=sursa;nod=tata[nod])
            {
                cap_flow[tata[nod]][nod]-=s;
                cap_flow[nod][tata[nod]]+=s;
            }
            flow+=s;
        }
    }
    printf("%d",flow);
    return 0;
}