#include<fstream>
#include<vector>
#include<queue>
#include<cstring>
using namespace std;
vector<int> L[1005];
queue<int> q;
bool u[1005];
int n, m, i, x, y, z, C[1005][1005], F[1005][1005], nod, vecin, minim, T[1005], flux, c;
int bfs()
{
    memset(u, 0, sizeof(u));
    q.push(1);
    u[1]=1;
    while(!q.empty())
    {
        nod=q.front();
        for(i=0; i<L[nod].size(); i++)
        {
            vecin=L[nod][i];
            if(u[vecin]==0 && C[nod][vecin]-F[nod][vecin]>0)
            {
                u[vecin]=1;
                q.push(vecin);
                T[vecin]=nod;
            }
        }
        q.pop();
    }
    return u[n]==1;
}
void maxflow()
{
    while(bfs())
    {
        for(i=0; i<L[n].size(); i++)
        {
            nod=L[n][i];
            if(u[nod]==1)
            {
                minim=C[nod][n]-F[nod][n];
                for(; T[nod]!=0 && minim!=0; nod=T[nod])
                {
                    minim=min(minim, C[T[nod]][nod]-F[T[nod]][nod]);
                }
                if(minim!=0)
                {
                    flux+=minim;
                    nod=L[n][i];
                    F[nod][n]+=minim;
                    F[n][nod]-=minim;
                    for(; T[nod]!=0; nod=T[nod])
                    {
                        F[T[nod]][nod]+=minim;
                        F[nod][T[nod]]-=minim;
                    }
                }
            }
        }
    }
}
ifstream in("maxflow.in");
ofstream out("maxflow.out");
int main()
{
    in>>n>>m;
    for(i=1; i<=m; i++)
    {
        in>>x>>y>>c;
        L[x].push_back(y);
        C[x][y]=c;
        L[y].push_back(x);
    }
    maxflow();
    out<<flux;
    return 0;
}