#include <bits/stdc++.h>
 
using namespace std;

int dp[1<<14];
vector <pair<int,int>> item[14];
int n,m,a,b,c;

int main(void)
{
	cin.tie(0);
	ios::sync_with_stdio(false);

	cin >> n >> m;

	for(int i=0;i<m;i++)
	{
		cin >> a >> b >> c;
		item[b].push_back(make_pair(a,c));
	}

	memset(dp,-1,sizeof(dp));
	dp[0] = 0;

	for(int i=0;i<(1<<n);i++)
	{
		if(dp[i]==-1) continue;
		for(int j=0;j<n;j++)
		{
			if((i&(1<<j))) continue;
			int score = 0;
			for(auto it : item[j])
			{
				if((i&(1 << it.first))) score += it.second;
			}
			dp[i + (1<<j)] = max(dp[i + (1<<j)],dp[i] + score);
		}
	}

	cout << dp[(1<<n)-1] << '\n';
	
	return 0;
}