#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n, m; cin >> n >> m;
	vector d(n, vector<int>(n, -INF));
	rep(i, m) {
		int a, b, c; cin >> a >> b >> c;
		a--, b--;
		chmax(d[a][b], c);
		chmax(d[b][a], c);
	}
	vector<vector<int>> dp(1 << n, vector<int>(n, -INF));
	rep(i, n) dp[1 << i][i] = 0;
	rep(i, 1 << n) {
		rep(j, n) {
			if (-INF == dp[i][j])continue;
			rep(k, n) {
				if (1 & (i >> k))continue;
				if (-INF == d[j][k])continue;
				int ni = i + (1 << k);
				chmax(dp[ni][k], dp[i][j] + d[j][k]);
			}
		}
	}
	int ans = 0;
	rep(i, 1 << n)rep(j, n)chmax(ans, dp[i][j]);
	cout << ans << endl;
	return 0;
}