#include <cstdio>
#include <algorithm>
#include <cstring>
#include <vector>
#define maxN 1005
using namespace std;
FILE *f=fopen("maxflow.in","r");
FILE *g=fopen("maxflow.out","w");
int N,M;
int F[maxN][maxN];
int C[maxN][maxN];
bool viz[maxN];
int T[maxN];
int Q[maxN];
int stq,drq;
vector<int> G[maxN];
bool BFS(int S,int D)
{
    Q[stq=drq=1]=S;
    memset(viz,0,sizeof(viz));
    viz[S]=1;
    while(stq<=drq)
    {
        int nod=Q[stq++];
        if(nod==D)continue;
        for(auto it:G[nod])
        {
            if(!viz[it]&&F[nod][it]<C[nod][it])
            {
                viz[it]=1;
                T[it]=nod;
                Q[++drq]=it;
            }
        }
    }
    return viz[D];
}
int maxflow(int S,int D)
{
    int flow=0;
    while(BFS(S,D))
    {
        for(auto it:G[D])
        {
            if(!viz[it]||F[it][D]==C[it][D])continue;
            int fmin=1<<30;
            T[D]=it;
            for(int nod=D;nod!=S;nod=T[nod])fmin=min(fmin,C[T[nod]][nod]-F[T[nod]][nod]);
            if(!fmin)continue;
            for(int nod=D;nod!=S;nod=T[nod]){F[T[nod]][nod]+=fmin;F[nod][T[nod]]-=fmin;}
            flow+=fmin;
        }
    }
    return flow;
}
int main()
{
    fscanf(f,"%d %d",&N,&M);
    for(int i=1;i<=M;i++)
    {
        int x,y,z;
        fscanf(f,"%d %d %d",&x,&y,&z);
        C[x][y]+=z;
        G[x].push_back(y);
        G[y].push_back(x);
    }
    fprintf(g,"%d",maxflow(1,N));
    fclose(f);
    fclose(g);
    return 0;
}