#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#define _USE_MATH_DEFINES
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;

#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()

const int INF = 0x3f3f3f3f;
const long long LINF = 0x3f3f3f3f3f3f3f3fLL;
const double EPS = 1e-8;
const int MOD = 1000000007; // 998244353;
const int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
/*-------------------------------------------------*/
int main() {
  cin.tie(0); ios::sync_with_stdio(false);
  // freopen("input.txt", "r", stdin);

  int n, m; cin >> n >> m;
  vector<vector<int> > cost(n, vector<int>(n, INF));
  while (m--) {
    int a, b, c; cin >> a >> b >> c; --a; --b;
    cost[a][b] = min(cost[a][b], -c);
    cost[b][a] = min(cost[b][a], -c);
  }
  vector<vector<long long> > dp(1 << n, vector<long long>(n, LINF));
  REP(i, n) dp[1 << i][i] = 0;
  FOR(i, 1, (1 << n) - 1) REP(j, n) if (i >> j & 1) {
    if (dp[i][j] == LINF) continue;
    REP(k, n) if (!(i >> k & 1)) {
      if (cost[j][k] != INF) dp[i | (1 << k)][k] = min(dp[i | (1 << k)][k], dp[i][j] + cost[j][k]);
      // bitset<5> bit1(i | (1 << k)), bit2(i);
      // cerr << bit1 << ' ' << k << '|' << bit2 << ' ' << j << '|' << dp[i][j] + cost[j][k] << '\n';
    }
  }
  long long ans = 0;
  REP(i, 1 << n) REP(j, n) ans = min(ans, dp[i][j]);
  cout << -ans << '\n';
  return 0;
}