#include<iostream>
#include<cstdio>
#include<cstring>
#include<queue>
using namespace std;
int n,m,mp[13][13],d[13],sum,ans;
bool vis[13];
void DFS(int nw,int dep)
{
	for(int i=1;i<=n;++i)
		if(!vis[i])
		{
			vis[i]=1;
			sum+=mp[nw][i]*dep;
			DFS(i,dep+1); 
		}
	return ;
}
int main()
{
	freopen("2017treasure.in","r",stdin);
	freopen("2017treasure.out","w",stdout);
	memset(mp,0x3f,sizeof(mp));
	int u,v,k;
	scanf("%d%d",&n,&m);
	for(int i=1;i<=m;++i) scanf("%d%d%d",&u,&v,&k),mp[u][v]=mp[v][u]=min(mp[u][v],k);
	for(int i=1;i<=n;++i)
	{
		vis[i]=1;
		DFS(i,1);
		memset(vis,0,sizeof(vis));
		ans=max(ans,sum);
		sum=0;
	}
	printf("%d\n",ans);
	return 0;
 }