#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int mod = 1e9 + 7,N = 200005;
int t,n,m;
int q[3005][3005];
void solve(){
    while(cin >> n >> m){
        memset(q,0,sizeof(q));
        for(int i = 0; i < m; ++i){
            int u,v,w;
            cin >> u >> v >> w;
            q[u][v] += w;
            q[v][u] += w;
        }
        int res = 1e9;
        for(int i = 1; i <= n; ++i){
            int cnt = 0;
            for(int j = 1; j <= n; ++j){
                if(i == j) continue;
                cnt += q[i][j];
            }
            res = min(res,cnt);
        }
        cout << res << endl;
    }
}
int main(){
//    freopen("input.txt","r",stdin);
//    cin >> t;
    t = 1;
    while(t--){
        solve();
    }
    return 0;
}