#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES

#include "bits/stdc++.h"
using namespace std;
#define REP(i,a,b) for(int i=a;i<b;++i)
#define rep(i,n) REP(i,0,n)
#define chmax(a, b) (a = (a) < (b) ? (b) : (a))
#define chmin(a, b) (a = (a) > (b) ? (b) : (a))
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define all(a) begin(a),end(a)
#define ifnot(a) if(not (a))
#define dump(x)  cerr << #x << " = " << (x) << endl
// #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 };
const int INF = 1 << 28;
const ll INFL = (ll)1 << 58;
ll mod = (int)1e9 + 7;
const double eps = 1e-10;
typedef long double Real;
// return -1, 0, 1
int sgn(const Real& r) { return (r > eps) - (r < -eps); }
int sgn(const Real& a, const Real &b) { return sgn(a - b); }

//.....................
const int MAX = (int)2e5 + 5;

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

class BitState {
public:
	int state;
	bool visited(int x) {
		return ((state >> x) & 1) == 1;
	}
	void add(int x) {
		state |= 1 << x;
	}
	int bit() {
		return state;
	}
};

void solve() {
	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) {
			BitState bs;
			bs.state = mask;
			if (bs.visited(i)) {
				int tmp = dp[mask & ~(1 << i)];
				rep(j, a[i].size()) {
					if (bs.visited(a[i][j].first)) {
						tmp += a[i][j].second;
					}
				}
				chmax(dp[mask], tmp);
			}
		}
	}
	cout << dp[(1 << N) - 1] << endl;
}

signed main() {
	int T = 10;
	cout << fixed << setprecision(15);
	rep(i, T) {
		char s[MAX];
		if (scanf("%s", s) == EOF) break;
		int n = strlen(s);
		for (int i = n - 1; i > -1; i--) {
			ungetc(s[i], stdin);
		}
		solve();
	}
	return 0;
}