#include <iostream>
#include <vector>
#include <queue>
#include <stack>
#include <cmath>
#include <algorithm>
using namespace std;

#define rep(i, N) for (int i = 0; i < N; i++)
#define repi(i, ini, N) for(int i = ini; i < N; i++)
#define chmax(i, j) i = max(i, j)
typedef long long ll;

int N, M;
ll dp[1<<14];
int score[14][14];

int main() {
  cin >> N >> M;
  int i1, i2, s;
  rep(i, 14) rep(j, 14) score[i][j] = 0;
  rep(i, M) {
    cin >> i1 >> i2 >> s;
    score[i1][i2] = s;
  }
  dp[0] = 0;
  rep(msk, 1<<N) {
    rep(nxt, N) if (!(msk & (1<<nxt))) {
      ll tmp = 0;
      rep(j, N) if (msk & (1<<j)) {
        tmp += score[j][nxt];
      }
      chmax(dp[msk+(1<<nxt)], dp[msk]+tmp);
    }
  }
  cout << dp[(1<<N)-1] << endl;
}