#include <cstdio>
#include <cstring>
#include <vector>
#include <algorithm>
using namespace std;

const int MAX_N = 14, MAX_M = MAX_N * (MAX_N - 1);

struct edge { int to, cost; };
vector<edge> G[MAX_N];

void add_edge(int from, int to, int cost) {
	G[from].push_back(edge{ to, cost });
}

int N, M;
int item1[MAX_M], item2[MAX_M], score[MAX_M];

int dp[1 << MAX_N];

void solve() {
	for (int i = 0; i < M; i++) {
		add_edge(item1[i], item2[i], score[i]);
	}

	sizeof(dp, -1, sizeof(dp));

	for (int S = 0; S < (1 << N); S++) {
		for (int i = 0; i < N; i++) {
			if (S >> i & 1) {
				for (int e = 0; e < G[i].size(); e++) {
					edge j = G[i][e];
					if (!(S >> j.to & 1)) {
						dp[S | 1 << j.to] = max(dp[S | 1 << j.to], dp[S] + j.cost);
					}
				}
			}
		}
	}

	printf("%d\n", dp[(1 << N) - 1]);
}

int main() {
	scanf("%d %d", &N, &M);
	for (int i = 0; i < M; i++) {
		scanf("%d %d %d", &item1[i], &item2[i], &score[i]);
	}

	solve();
}