#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES

#include "bits/stdc++.h"
#define REP(i,a,b) for(int i=a;i<b;++i)
#define rep(i,n) REP(i,0,n)
#define ll long long
#define ull unsigned ll
typedef long double ld;
#define ALL(a) begin(a),end(a)
#define ifnot(a) if(not a)
#define dump(x)  cerr << #x << " = " << (x) << endl
using namespace std;

// #define int ll
#ifdef _MSC_VER
const bool test = true;
#else 
const bool test = false;
#endif

int dx[] = { 0,1,0,-1 };
int dy[] = { 1,0,-1,0 };
#define INF (1 << 28)
ull mod = (int)1e9 + 7;
//.....................
#define MAX (int)1e6 + 5

int N, M;
vector<pair<int, int>> a[15];
int dp[1 << 16];

void print() {
	rep(i, 1 << N) {
		string s;
		rep(j, N) {
			if ((i >> j) & 1) s.push_back('1');
			else s.push_back('0');
		}
		reverse(ALL(s));
		cerr << "dp[" << s << "]= " << dp[i] << endl;
	}
}

signed main() {
	cin >> N >> M;
	rep(i, M) {
		int item1, item2, score;
		cin >> item1 >> item2 >> score;
		a[item2].push_back({ item1,score });
	}
	rep(mask, 1 << N) {
		rep(i, N) {
			if (mask & (1 << i)) continue;

			int next_mask = mask | (1 << i);
			// if (mask == next_mask) cerr << "error!" << endl;
			int tmp = dp[mask];
			rep(j, a[i].size()) {
				if (mask & (1 << a[i][j].first)) {
					tmp += a[i][j].second;
				}
			}
			if (tmp > dp[next_mask]) dp[next_mask] = tmp;
		}
		// dump(mask);
		// print();
		cerr << endl;
	}

	cout << dp[(1 << N) - 1] << endl;
	return 0;
}