#include <iostream>
#include <algorithm>
#include <cstring>
#include <sstream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#include <stack>
#include <cstdio>
#include <cmath>
#define mk make_pair
#define pb push_back
#define printf printf_s
#define scanf scanf_s
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pos;
const ll MOD = 1000000007, N = 100001, dx[4] = { -1,1,0,0 }, dy[4] = { 0,0,-1,1 }, MIN = -72340172838, MAX = 72340172838;

ll mn(ll a, ll b) {
	if (a == -1)return b;
	if (b == -1)return a;
	return min(a, b);
}
ll gcd(ll v1, ll v2) {
	if (v1 == 0)return v2; if (v2 == 0)return v1; if (v2 > v1)return gcd(v2%v1, v1); return gcd(v1%v2, v2);
}

ll pw(ll v1, ll v2) {
	ll v3 = 1;
	while (v2 > 0) {
		if (v2 % 2)v3 = (v3*v1) % MOD;
		v1 = (v1*v1) % MOD;
		v2 /= 2;
	}
	return v3;
}

struct ab {
	ll a, b;
	bool operator<(const ab& right) const {
		return right.b*a - right.a*b < 0;
	}
};

ll n, m, a[14][14], dp[1 << 14][14], vv[1 << 14][14];

int main() {
	cin >> n >> m;
	while(m--){
		ll v1, v2, v3;
		cin >> v1 >> v2 >> v3;
		a[v1][v2] = v3;
	}
	for (int s = 0; s < (1 << n); s++) {
		for (int i = 0; i < n; i++) {
			if ((s >> i) & 1)continue;
			for (int j = 0; j < n; j++) {
				if ((s >> j) & 1)
				vv[s][i] += a[j][i];
			}
		}
	}
	for (int s = 0; s < (1 << n); s++) {
		for (int i = 0; i < n; i++) {
			if (!((s >> i) & 1))continue;
			for (int j = 0; j < n; j++) {
				dp[s | (1 << j)][j] = max(dp[s | (1 << j)][j], dp[s][i]+vv[s][j]);
			}
		}
	}
	ll ans = 0;
	for (int i = 0; i < n; i++)ans = max(ans, dp[(1 << n) - 1][i]);
	cout << ans << endl;
	return 0;
}