#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <queue>
#include <utility>
using namespace std;

typedef pair<int, int> P;
typedef unsigned long long ll;

const int inf = 999999999;
const int mod = 1000000007;

int dp[1 << 14];

int main(){
	int n, m;
	cin >> n >> m;
	int d[n][n];
	for(int i = 0; i < n; i++){
		for(int j = 0; j < n; j++){
			d[i][j] = 0;
		}
	}
	for(int i = 0; i < m; i++){
		int x, y, z;
		cin >> x >> y >> z;
		d[x][y] = z;
	}
	for(int S = 0; S < (1 << n); S++){
		for(int i = 0; i < n; i++){
			if((S & (1 << i)) == 0){
				int t = 0;
				for(int j = 0; j < n; j++){
					if(S & (1 << j)){
						t += d[j][i];
					}
				}
				dp[S | (1 << i)] = max(dp[S | (1 << i)], dp[S] + t);
			}
		}
	}
	cout << dp[(1 << n) - 1] << endl;
	return 0;
}