#include <iostream>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <algorithm>
#include <numeric>
#include <queue>
#include <cassert>
#include <cmath>
#include <bitset>
using namespace std;

int n, m;
long long a[20][20];
long long dp[20000];

void chmax(long long &a, long long b) {
  a = max(a, b);
}

int main() {
  cin >> n >> m;
  for (int k = 0; k < m; k++) {
    int i, j;
    cin >> i >> j;
    cin >> a[i][j];
  }

  for (int s = 0; s < (1<<n); s++)
    for (int i = 0; i < n; i++)
      for (int j = 0; j < n; j++)
        if (!(s&(1<<i)) && (s&(1<<j))) {
          if (i < j) chmax(dp[s|(1<<i)], dp[s] + (a[i][j]));
          if (j < i) chmax(dp[s|(1<<i)], dp[s] + (a[i][j]));
        }
  
  //for (int s = 0; s < (1<<n); s++) cout << "dp[" << bitset<4>(s) << "] = " << dp[s] << endl;

  cout << dp[(1<<n)-1] << endl;
}