#include <iostream>
#include <algorithm>
#include <vector>
#include <cstdio>
#include <cmath>
#include <string>
#include <queue>
#include <list>

using namespace std;

int points[14][14];

int main(){
    int i,j,k,l;
    int n,m;
    
    cin >> n >> m;
    
    for (i=0;i<m;i++){
        cin>>j>>k>>l;
        points[j][k]=l;
    }
    
    vector<int> v;
    for (i=0;i<n;i++){
        v.push_back(i);
    }
    
    sort(v.begin(),v.end(),[](int x,int y){return points[x][y]>points[y][x];});
    
    j=0;
    for (i=1;i<n;i++){
        j+=points[v[i-1]][v[i]];
    }
    cout<<j<<endl;
    
    
    return 0;
}