#include <algorithm>
#include <iostream>
#include <iomanip>
#include <cstring>
#include <string>
#include <vector>
#include <queue>
#include <cmath>
#include <stack>
#include <set>
#include <map>
typedef long long ll;
using namespace std;

int main(){
  int N,M;
  cin >> N >> M;
  int sco[N][N];
  fill(sco[0],sco[N],0);
  for(int i=0;i<M;i++){
    int x,y,s;
    cin >> x >> y >> s;
    sco[x][y] = s;
  }

  int dp[1 << N];
  fill(dp,dp+(1<<N),0);
  for(int msk=0 ; msk<(1<<N) ; msk++){
    for(int i=0;i<N;i++){
      if(!(msk & (1 << i))){
        int sum = 0;
        for(int j=0;j<N;j++){
          if(msk & (1 << j)){
            sum += sco[i][j];
          }
        }
        dp[msk + (1 << i)] = max(dp[msk + (1 << i)], dp[msk] + sum);
      }
    }
  }

  cout << dp[(1 << N) - 1] << endl;
  return 0;
}