#include <bits/stdc++.h>
#define REP(i,n,N) for(int i=n;i<N;i++)
#define p(S) cout<<(S)<<endl
#define ck(a,b) (0<=(a)&&(a)<b)
using namespace std;

int dp[1<<14];
int main(){
	int n,m;
	cin>>n>>m;
	int score[14][14];
	int a,b;
	REP(i,0,n) REP(j,0,n) score[i][j]=0;
	REP(i,0,m) {
		cin>>a>>b;
		cin>>score[a][b];
	}
	REP(i,0,1<<n) dp[i]=0;
	REP(mask,0,1<<n){
		REP(j,0,n){
			if((mask & 1<<j) ==0){
				int cost=0;
				REP(i,0,n) if((mask & 1<<i)) cost+=score[i][j];
				dp[mask|1<<j]=max(dp[mask|1<<j],dp[mask]+cost);
			}
		}
	}
	p(dp[(1<<n)-1]);
	return 0;
}