#include <cstdio>
#include <vector>
#include <queue>
#include <cstring>
#define NMAX 1010
#define pb push_back
#define inf 1<<30

using namespace std;

vector<int> G[NMAX];
int C[NMAX][NMAX];
int T[NMAX],F[NMAX][NMAX],n,m;

int BFS()
{
    int nod,i,viz[NMAX];
    queue<int> Q;
    memset(T,0,sizeof(T));
    memset(viz,0,sizeof(viz));

    Q.push(1);viz[1] = 1;
    while(!Q.empty())
    {
        nod = Q.front();
        Q.pop();

        for(i=0;i<G[nod].size();i++)
            if(!viz[G[nod][i]] && C[nod][G[nod][i]]>F[nod][G[nod][i]])
            {
                viz[G[nod][i]] = 1;
                Q.push(G[nod][i]);
                T[G[nod][i]] = nod;
                if(G[nod][i]==n) return 1;
            }
    }

    return 0;
}

int main()
{
    int i,a,b,flow,fmin,c;
    freopen("maxflow.in","r",stdin);
    freopen("maxflow.out","w",stdout);

    scanf("%d%d",&n,&m);
    for(i=0;i<m;i++)
    {
        scanf("%d%d%d",&a,&b,&c);
        G[a].pb(b);
        G[b].pb(a);
        C[a][b] = c;
    }

    for(flow = 0;BFS();flow+=fmin)
    {
        fmin = inf;
        for(i=n;i!=1;i=T[i])
            fmin = min(fmin,C[T[i]][i] - F[T[i]][i]);
        for(i=n;i!=1;i=T[i])
        {
            F[T[i]][i] += fmin;
            F[i][T[i]] -= fmin;
        }
    }

    printf("%d",flow);
}