#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int mxN = 210;
set<pair<ll, ll>> adj[mxN];
ll c[mxN], vis[mxN][mxN];
int main(){
ll n, m, u, v, w, ans = 0;
cin >> n >> m;
memset(vis, -1, sizeof(vis));
for(int i = 1; i <= m; ++i){
cin >> u >> v >> w;
adj[u].insert({v, w});
adj[v].insert({u, w});
vis[u][v] = w;
vis[v][u] = w;
c[u] += w;
c[v] += w;
ans = max({ans, c[u], c[v]});
}
/*
for(int i = 1; i <= n; ++i){
for(auto j : adj[i]){
for(auto k : adj[j.first]){
if(vis[i][k.first] != -1){
ans = max(ans, j.second + k.second + vis[i][k.first]);
}
}
}
}
*/
cout << ans << "\n";
return 0;
}
