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

#define INF 0x3f3f3f3f
#define pb push_back
#define mp make_pair
#define sc second
#define fs first
#define DIM 65

int gin[DIM],gout[DIM],t[DIM],dist[DIM],viz[DIM];
vector <pair <int,int> > g[DIM];
int c[DIM][DIM],f[DIM][DIM];
int n,m,s,d,cost;
queue <int> q;

void read ()
{
    int i,x,y,z;

    scanf ("%d%d",&n,&m);
    s=0; d=n+1;
    for (i=1; i<=m; ++i)
    {
        scanf ("%d%d%d",&x,&y,&z);
        g[x].pb (mp (y,z));
        g[y].pb (mp (x,-z));
        c[x][y]=INF;
        ++gout[x];
        ++gin[y];
        cost+=z;
    }

}

void init ()
{
    int i;

    for (i=1; i<=n; ++i)
        if (gin[i]>gout[i])
        {
            g[s].pb (mp (i,0));
            g[i].pb (mp (s,0));
            c[s][i]=gin[i]-gout[i];
        }
        else if (gin[i]<gout[i])
        {
            g[i].pb (mp (d,0));
            g[d].pb (mp (i,0));
            c[i][d]=gout[i]-gin[i];
        }
}

int bellman_ford ()
{
    int nod,i;

    memset (t,0,sizeof (t));
    memset (viz,0,sizeof (viz));
    memset (dist,INF,sizeof (dist));

    dist[s]=0;
    for (q.push (s); !q.empty (); q.pop ())
    {
        viz[nod=q.front ()]=0;
        for (i=0; i<(int)g[nod].size (); ++i)
            if (c[nod][g[nod][i].fs]>f[nod][g[nod][i].fs] && dist[nod]+g[nod][i].sc<dist[g[nod][i].fs])
            {
                dist[g[nod][i].fs]=dist[nod]+g[nod][i].sc;
                t[g[nod][i].fs]=nod;
                if (!viz[g[nod][i].fs])
                {
                    q.push (g[nod][i].fs);
                    viz[g[nod][i].fs]=1;
                }

            }
    }
    if (dist[d]!=INF)
        return 1;
    return 0;
}

void solve ()
{
    int i,minim;

    while (bellman_ford ())
    {
        minim=INF;
        for (i=d; i!=s; i=t[i])
            minim=min (minim,c[t[i]][i]-f[t[i]][i]);
        for (i=d; i!=s; i=t[i])
        {
            f[t[i]][i]+=minim;
            f[i][t[i]]-=minim;
        }
        cost+=minim*dist[d];
    }
    printf ("%d",cost);
}

int main ()
{
    freopen ("traseu.in","r",stdin);
    freopen ("traseu.out","w",stdout);

    read ();
    init ();
    solve ();

    return 0;
}