#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n);i++)
#define sz(x) int(x.size())
typedef long long ll;
typedef pair<int,int> P;

int main(){
  int n, m;
  cin >> n >> m;
  vector<vector<int>> item(n, vector<int>(n,0));
  rep(i,m) {
    int u, v, c;
    cin >> u >> v >> c;
    item[u][v] = c;
  }
  
  vector<vector<int> > dp(1<<n,vector<int>(n,0));

  for (int bit = 0; bit < (1<<n); bit++) {
    for (int i = 0; i < n; i++) {
      if (bit & (1 << i)) continue;
      int cost = 0;
      for (int j = 0; j < n; j++) {
        if (bit & (1 << j)) cost += item[j][i];
      }
      for (int j = 0; j < n; j++) {
        if (bit & (1 << j)) dp[bit|(1<<i)][i] = max(dp[bit|(1<<i)][i], dp[bit][j] + cost);
      }
    }
  }
  int res = 0;
  rep(i,n) res = max(res, dp[(1<<n)-1][i]);
  cout << res << endl;
  return 0;
}