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

const int NMAX = 65, INF = 0x3f3f3f3f;

int N, M, Source, Sink, In[NMAX], Out[NMAX], Cost[NMAX][NMAX], Dist[NMAX], Father[NMAX], Cap[NMAX][NMAX], Flow[NMAX][NMAX];
int X, Y, Z, Sum;
vector<int> G[NMAX];
bool InQueue[NMAX];

bool BellmanFord()
{
    for(int i = Source; i <= Sink; ++ i) Dist[i] = INF, Father[i] = 0, InQueue[i] = 0;
    queue<int> Q;
    Q.push(Source);
    Dist[Source] = 0;

    while(!Q.empty())
    {
        int Node = Q.front();
        Q.pop();

        InQueue[Node] = 0;

        for(int i = 0; i < G[Node].size(); ++ i)
        {
            int Vec = G[Node][i];
            if(Cap[Node][Vec] > Flow[Node][Vec] && Dist[Vec] > Dist[Node] + Cost[Node][Vec])
            {
                Dist[Vec] = Dist[Node] + Cost[Node][Vec];
                Father[Vec] = Node;
                if(!InQueue[Vec]) Q.push(Vec), InQueue[Vec] = 1;
            }
        }
    }
    return Dist[Sink] != INF;
}

int DoFlow()
{
    int MinFlow, Ans = 0;
    while(BellmanFord())
    {
        MinFlow = INF;
        for(int Node = Sink; Node != Source; Node = Father[Node])
            MinFlow = min(MinFlow, Cap[Father[Node]][Node] - Flow[Father[Node]][Node]);
        for(int Node = Sink; Node != Source; Node = Father[Node])
        {
            Flow[Father[Node]][Node] += MinFlow;
            Flow[Node][Father[Node]] -= MinFlow;
        }
        Ans += MinFlow * Dist[Sink];
    }
    return Ans;
}

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

    scanf("%i %i", &N, &M);

    for(int i = 1; i <= N; ++ i)
        for(int j = 1; j <= N; ++ j)
            Cost[i][j] = INF;

    for(int i = 1; i <= M; ++ i)
    {
        scanf("%i %i %i", &X, &Y, &Z);
        Sum += Z;
        Cost[X][Y] = Z;
        In[Y] ++;
        Out[X] ++;
    }

    for(int k = 1; k <= N; ++ k)
        for(int i = 1; i <= N; ++ i)
            for(int j = 1; j <= N; ++ j)
                if(i != j && i != k && j != k)
                    Cost[i][j] = min(Cost[i][j], Cost[i][k] + Cost[k][j]);

    Source = 0; Sink = N + 1;

    for(int i = 1; i <= N; ++ i)
        for(int j = 1; j <= N; ++ j)
            if(In[i] > Out[i] && In[j] < Out[j])
            {
                G[i].push_back(j);
                G[j].push_back(i);
                Cap[i][j] = INF;
                Cost[j][i] = -Cost[i][j];
            }

    for(int i = 1; i <= N; ++ i)
    {
        if(In[i] > Out[i])
        {
            G[Source].push_back(i);
            G[i].push_back(Source);
            Cap[Source][i] = In[i] - Out[i];
        }
        if(In[i] < Out[i])
        {
            G[i].push_back(Sink);
            G[Sink].push_back(i);
            Cap[i][Sink] = Out[i] - In[i];
        }
    }

    printf("%i\n", Sum + DoFlow());
}