#include <iostream>
#include <vector>
using namespace std;
long long dp[(1<<17)][20],e[20][20] = {};
int main(){
	int i,j,k,n,m;
	cin >> n >> m;
	for(i=0;i<m;i++){
		int a,b,c;
		cin >> a >> b >> c;
		a--; b--;
		e[a][b] = c; e[b][a] = c;
	}
	for(i=0;i<(1<<n);i++){
		for(j=0;j<n;j++){
			dp[i][j] = -100000000000000000;
		}
	}
	for(i=0;i<n;i++){
		dp[(1<<i)][i] = 0;
	}
	for(i=0;i<(1<<n);i++){
		for(j=0;j<n;j++){
			if(!((1<<j) & i)) continue;
			int l = i^(1<<j);
			for(k=0;k<n;k++){
				if(!((1<<k) & l)) continue;
				if(e[k][j]) dp[i][j] = max(dp[i][j],dp[l][k] + e[k][j]);
			}
		}
	}
	long long mx = 0;
	for(i=0;i<(1<<n);i++){
		for(j=0;j<n;j++){
			mx = max(dp[i][j],mx);
		}
	}
	cout << mx << endl;
}