#include <iostream>
#include <fstream>
#include <queue>
#include <vector>

using namespace std;
const int nmax=65;
vector<int> v[nmax];
queue<int> q;
int cost[nmax][nmax],c[nmax][nmax],fl[nmax][nmax];
int in[nmax],out[nmax],dist[nmax],prc[nmax];
int n,m,source,sink,start,nod,a,b,i,j,sum;
bool bf()
{
    for(i=1;i<=sink;i++)
        dist[i]=(1<<30);
    dist[source]=0;q.push(source);
    while(!q.empty())
    {
        start=q.front();q.pop();
        for(i=0;i<v[start].size();i++)
        {
            nod=v[start][i];
            if(fl[start][nod]<c[start][nod]&&dist[start]+cost[start][nod]<dist[nod])
            {
                dist[nod]=dist[start]+cost[start][nod];
                prc[nod]=start;
                q.push(nod);
            }
        }
    }
    return (dist[sink]!=(1<<30));
}
int main()
{
    ifstream f("traseu.in");
    ofstream g("traseu.out");
    f>>n>>m;source=n+1;sink=n+2;
    for(i=1;i<=m;i++)
    {
        f>>a>>b;
        out[a]++;in[b]++;
        f>>cost[a][b];
        cost[b][a]=-cost[a][b];
        sum+=cost[a][b];
    }
    for(i=1;i<=n;i++)
    {
        if(out[i]<in[i])
        {
            c[source][i]=in[i]-out[i];
            v[source].push_back(i);
            for(j=1;j<=n;j++)
                if(cost[i][j]>0&&in[j]<out[j])
            {
                c[i][j]=(1<<30);
                v[i].push_back(j);
                v[j].push_back(i);
            }
        }
        if(out[i]>in[i])
        {
            c[i][sink]=out[i]-in[i];
            v[i].push_back(sink);
        }
    }
    while(bf())
    {
        nod=sink;
        while(nod!=source)
        {
            fl[prc[nod]][nod]++;
            fl[nod][prc[nod]]--;
            nod=prc[nod];
        }
        sum+=dist[sink];
    }
    g<<sum;
    return 0;
}