#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0;i<((int)(n));i++)
#define reg(i,a,b) for(int i = ((int)(a));i<=((int)(b));i++)
#define irep(i,n) for(int i = ((int)(n)-1);i>=0;i--)
#define ireg(i,a,b) for(int i = ((int)(b));i>=((int)(a));i--)
typedef long long ll;

/*
グラフ上の最長経路問題
*/

ll n,m,dp[1<<16][16][16],ans=-1e18;
vector<ll> v[20],d[20];

ll f(ll s,ll p,ll q){
	if(dp[s][p][q]!=-1e18)return dp[s][p][q];
	ll sum=0;
	rep(i,v[p].size()){
		if(!(1 & s>>v[p][i])){
			sum=max(sum,f(s+(1<<v[p][i]),v[p][i],q)+d[p][i]);
		}
	}
	rep(i,v[q].size()){
		if(!(1 & s>>v[q][i])){
			sum=max(sum,f(s+(1<<v[q][i]),p,v[q][i])+d[q][i]);
		}
	}
	return dp[s][p][q]=sum;
}

void init(){
	cin>>n>>m;
	rep(i,m){
		ll a,b,c;
		cin>>a>>b>>c;
		a--;b--;
		v[a].push_back(b);
		v[b].push_back(a);
		d[a].push_back(c);
		d[b].push_back(c);
	}
	rep(i,1<<16)rep(j,16)rep(k,16)dp[i][j][k]=-1e18;
}

int main(void){
	init();
	rep(i,n){
		ans=max(ans,f(1<<i,i,i));
	}
	cout<<ans<<endl;
	return 0;
}