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

const int NMAX = 65, INF = 0x3f3f3f3f;

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

bool BF()
{
    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(vector<int> :: iterator it = G[Node].begin(); it != G[Node].end(); ++ it)
            if(Cap[Node][*it] > Flow[Node][*it] && Dist[*it] > Dist[Node] + Cost[Node][*it])
            {
                Dist[*it] = Dist[Node] + Cost[Node][*it];
                Father[*it] = Node;
                if(!InQueue[*it])
                    InQueue[*it] = 1, Q.push(*it);
            }
    }

    return (Dist[Sink] != INF);
}

void FMCM()
{
    while(BF())
    {
        int 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];
    }

    printf("%i\n", 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;
    Source = 0;
    Sink = N + 1;

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

    for(int k = 1; k <= N; ++ k)
        for(int i = 1; i <= N; ++ i)
            for(int j = 1; j <= N; ++ j)
                if(i != k && j != k)
                    Cost[i][j] = min(Cost[i][j], Cost[i][k] + Cost[k][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(Out[i] > In[i])
        {
            G[Sink].push_back(i);
            G[i].push_back(Sink);
            Cap[i][Sink] = Out[i] - In[i];
        }
    }

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

    FMCM();

    return 0;
}