#include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <ratio>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#include <climits>
#define ll long long
#define ld long double
#define mp make_pair
#define pb push_back
#define in insert
#define vll vector<ll>
#define endl "\n"
#define pll pair<ll,ll>
#define f first
#define s second
#define FOR(i,a,b) for(int i=(a),_b=(b); i<=_b; i++)
#define int ll
#define sz(x) (ll)x.size()
#define all(x) (x.begin(),x.end())
using namespace std;
const ll INF = 1e12;
const ll N =(3e5+5); // TODO : change value as per problem
const ll MOD = 1e9+7;
vector<pair<int,int>> adj2[N];
map<pll,ll> cost;
void solve(){
int n,m;
cin >> n >> m;
for(int i =1;i<=m;i++){
int u,v;
int ch;
cin >> u >> v >> ch;
adj2[u].pb({ch,v});
adj2[v].pb({ch,u});
cost[{u,v}] = ch;
cost[{v,u}] = ch;
}
for(int i =1;i<=n;i++){
sort(adj2[i].begin(),adj2[i].end());
}
int ans = 0;
for(int i =1 ;i<=n;i++){
int cur = 0;
if((int)adj2[i].size() < 2) continue;
// it--;
// auto it2 = it-1;
pll p = adj2[i].back();
int u = p.s;
cur += p.f;
// it++;
pll p2 = adj2[i][adj2[i].size()-2];
int v = p2.s;
cur += p2.f;
cur += cost[{u,v}];
ans = max(ans,cur);
}
for(int i =1;i<=n;i++){
int cur = 0;
for(auto p:adj2[i]){
cur += p.f;
}
ans = max(ans,cur);
}
cout << ans << endl;
}
signed main(){
ios_base::sync_with_stdio(0);
cin.tie(NULL);
// freopen(".in","r",stdin);freopen(".out","w",stdout);
ll tt=1;
// cin >> tt;
while(tt--){
solve();
}
}
