#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <bitset>
#include <map>
#include <unordered_map>
#include <list>
#include <numeric>
#include <utility>
#include <iterator>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <ctime>
#include <cassert>

#define INF 1000000000
#define LINF 9000000000000000000
#define mod 1000000007

#define rep(i,n) for(int i=0;i<int(n);i++)
#define rrep(i,n) for(int i=n-1;i>=0;i--)
#define REP(i,a,b) for(int i=(a);i<int(b);i++)
#define all(x) (x).begin(),x.end()
#define pb push_back
#define mp make_pair

using namespace std;

/*
   cin.tie(0);
   ios::sync_with_stdio(false);
   */

typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<long long>vll;
typedef pair<int,int> pi;
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
int ddx[8]={-1,-1,0,1,1,1,0,-1};
int ddy[8]={0,1,1,1,0,-1,-1,-1};
bool debug=false;

/*---------------------------------------------------*/

bool contain(int mask,int pos){
  return (mask&(1<<pos))!=0;
}

int main(){
  int n,m;
  cin>>n>>m;
  vector<int> item1(m),item2(m),score(m);
  vector<int> dp(1<<n,0);
  rep(i,m)cin>>item1[i]>>item2[i]>>score[i];
  for(int mask=1;mask<(1<<n);mask++){
    for(int i=0;i<n;i++){
      if(contain(mask,i)){
	int sum=0;
	for(int j=0;j<m;j++){
	  if(contain(mask,item1[j])&&item2[j]==i){
	    sum+=score[j];
	  }
	  dp[mask]=max(dp[mask],dp[mask^(1<<i)]+sum);
	}
      }
    }
  }
  cout<<dp[(1<<n)-1]<<endl;
  return 0;
}