#include <bits/stdc++.h>

using namespace std;

int dp[1 << 16][16];
vector <pair<int, int>> adj[16];
int n, m, a, b, c;

int main(void)
{
	cin.tie(0);
	ios::sync_with_stdio(false);
	
	cin >> n >> m;

	for (int i = 0; i < m; i++)
	{
		cin >> a >> b >> c;
		a -= 1;
		b -= 1;
		adj[a].push_back(make_pair(b, c));
		adj[b].push_back(make_pair(a, c));
	}

	for (int i = 0; i < (1 << 16); i++)
	{
		for (int j = 0; j < 16; j++)
		{
			dp[i][j] = -1e9;
		}
	}

	for (int i = 0; i < n; i++)
	{
		dp[1 << i][i] = 0;
	}

	for (int i = 0; i < (1 << n); i++)
	{
		for (int j = 0; j < n; j++)
		{
			if (dp[i][j] <= -1e9) continue;
			for (auto it : adj[j])
			{
				int k = it.first;
				int cost = it.second;
				if ((i & (1 << k))) continue;
				int mask = i + (1 << k);
				dp[mask][k] = max(dp[mask][k], dp[i][j] + cost);
			}
		}
	}

	int res = 0;

	for (int i = 0; i < (1 << n); i++)
	{
		for (int j = 0; j < n; j++)
		{
			res = max(res, dp[i][j]);
		}
	}

	cout << res << '\n';

	return 0;
}