#include<iostream>
#include<string>
#include<iomanip>
#include<cmath>
#include<vector>
#include<algorithm>

using namespace std;

#define int long long
#define rep(i,n) for(int i = 0; i < (n); i++)
#define endl "\n"

const long long INF = (long long)1e18;
const long long MOD = (long long)1e9 + 7; 

string yn(bool f){return f?"Yes":"No";}
string YN(bool f){return f?"YES":"NO";}

#define MAX 20

signed main(){
	cin.tie(0);
	ios::sync_with_stdio(false);
	cout<<fixed<<setprecision(10);
	
	int N, M;
	int a, b, c;
	int ans = 0;
	static int cost[MAX][MAX];
	static int dp[MAX][(1<<17)];

	cin>>N>>M;
	
	for(int i = 0; i < M; i++){
		cin>>a>>b>>c;
		a--, b--;
		cost[a][b] = c;
		cost[b][a] = c;
	}
	
	for(int i = 1; i < (1<<N); i++){
		for(int j = 0; j < N; j++){
			if(!(i&(1<<j))) continue;
			int bit = i&(~(1<<j));
			int maximum = 0;
			for(int k = 0; k < N; k++){
				if(!(bit&(1<<k))) continue;
				int bit2 = bit&(~(1<<k));
				if(!cost[k][j]) continue;
				
				maximum  = max(maximum, dp[k][bit2] + cost[k][j]);
			}
			dp[j][bit] = maximum;
			ans = max(maximum, ans);
		}
	}
	
	cout<<ans<<endl;
	
	return 0;
}