#include <cstdio>
#include <algorithm>
#include <vector>
#include <queue>
#include <bitset>
using namespace std;

#define Nmax 65
#define inf 0x3f3f3f3f

FILE *f = fopen ( "traseu.in", "r" );
FILE *g = fopen ( "traseu.out", "w" );

int N, M, Sink, Source, TotalCost = 0;
int Cap[Nmax][Nmax], Flow[Nmax][Nmax], Cost[Nmax][Nmax], Tata[Nmax], Dist[Nmax], Int[Nmax], Ext[Nmax];
vector < int > G[Nmax];
queue < int > Q;
bitset < Nmax > inQ;

void AddEdge ( int x, int y, int cost, int cap ){
    G[x].push_back ( y );
    G[y].push_back ( x );
    Cost[x][y] = cost;
    Cost[y][x] = -cost;
    Cap[x][y] = cap;
}

bool BellmanFord (){

    vector < int > :: iterator it;

    for ( int i = Source; i <= Sink; ++i ){
        Dist[i] = inf;
        inQ[i] = 0;
    }

    Dist[Source] = 0;
    Q.push( Source );
    inQ[Source] = 1;

    while ( !Q.empty() ){
        int nod = Q.front();
        Q.pop();
        inQ[nod] = 0;
        for ( it = G[nod].begin(); it < G[nod].end(); ++it ){
            if ( Cap[nod][*it] > Flow[nod][*it] && Dist[*it] > Dist[nod] + Cost[nod][*it] ){
                Dist[*it] = Dist[nod] + Cost[nod][*it];
                Tata[*it] = nod;
                if ( !inQ[*it] ){
                    Q.push ( *it );
                    inQ[*it] = 0;
                }
            }
        }
    }

    return Dist[Sink] != inf;
}

void FMCM (){
    int MinFlow;

    while ( BellmanFord() ){
        MinFlow = inf;

        for ( int nod = Sink; nod != Source; nod = Tata[nod] )
            MinFlow = min ( MinFlow, Cap[Tata[nod]][nod] - Flow[Tata[nod]][nod] );

        for ( int nod = Sink; nod != Source; nod = Tata[nod] ){
            Flow[Tata[nod]][nod] += MinFlow;
            Flow[nod][Tata[nod]] -= MinFlow;
        }

        TotalCost += MinFlow * Dist[Sink];
    }

    fprintf ( g, "%d", TotalCost );
}

int main(){

    int x, y, c;

    fscanf ( f, "%d%d", &N, &M );

    Source = 0; Sink = N + 1;

    for ( int i = 1; i <= M; ++i ){
        fscanf ( f, "%d%d%d", &x, &y, &c );

        Ext[x]++;
        Int[y]++;
        TotalCost += c;

        AddEdge ( x, y, c, inf );
    }

    for ( int i = 1; i <= N; ++i ){
        if ( Int[i] > Ext[i] )
            AddEdge ( Source, i, 0, Int[i] - Ext[i] );
        else
            if ( Ext[i] > Int[i] )
                AddEdge ( i, Sink, 0, Ext[i] - Int[i] );
    }

    FMCM();

    return 0;
}