#include <cassert>
#include <cmath>
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <climits>
#include <map>
#include <queue>
#include <set>
#include <cstring>
#include <vector>

using namespace std;
typedef long long ll;

int main() {
  int N, M;
  cin >> N >> M;
  int score[N][N];
  memset(score, 0, sizeof(score));

  int a, b, c;
  for (int i = 0; i < M; ++i) {
    cin >> a >> b >> c;
    score[a][b] = c;
  }
  
  int dp[1 << N];
  memset(dp, 0, sizeof(dp));

  for (int mask = 0; mask < (1 << N); ++mask) {
    for (int i = 0; i < N; ++i) {
      if (mask >> i & 1) continue;
      int v = 0;

      for (int j = 0; j < N; ++j) {
        if (mask >> j & 1) {
          v += score[j][i];
        }
      }

      int nmask = mask | (1 << i);
      dp[nmask] = max(dp[nmask], dp[mask] + v);
    }
  }

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

  return 0;
}