#include <iostream>
#include <cstdio>
#include <cstring>
#include <vector>
#include <deque>
#include <queue>
#include <array>
#include <set>
#include <map>
#include <cmath>
#include <algorithm>
#include <numeric>
#include <cassert>
#include <utility>
#include <tuple>
#include <functional>
#include <bitset>
#include <cstdint>

using namespace std;
using i64 = int64_t;
using i32 = int32_t;
template<class T, class U> void init_n(vector<T>& v, size_t n, U x) 
{ v = vector<T>(n, x); }
template<class T> void init_n(vector<T>& v, size_t n) { init_n(v, n, T()); }
template<class T> void read_n(vector<T>& v, size_t n, size_t o = 0) 
{ v = vector<T>(n+o); for (size_t i=o; i<n+o; ++i) cin >> v[i]; }
template<class T> void read_n(T a[], size_t n, size_t o = 0)
{ for (size_t i=o; i<n+o; ++i) cin >> a[i]; }
template<class T> T gabs(const T& x) { return max(x, -x); }
#define abs gabs

i64 n, m;
vector<vector<pair<i64, i64>>> g;
vector<vector<i64>> dp;

i64 dfs(i64 u, i64 s) {
  if (dp[u][s]) return dp[u][s];
  s |= 1 << (u - 1);
  i64 y = 0;
  for (const auto& p : g[u]) {
    i64 c, v;
    tie(c, v) = p;
    if (!(s & (1 << (v - 1)))) {
      y = max(y, c + dfs(v, s));
    }
  }
  return dp[u][s] = y;
}

int main() {
  cin >> n >> m;
  init_n(g, n + 1);
  for (i64 i = 0; i < m; ++i) {
    i64 a, b, c;
    cin >> a >> b >> c;
    g[a].emplace_back(c, b);
    g[b].emplace_back(c, a);
  }
  for (i64 u = 1; u <= n; ++u) {
    sort(begin(g[u]), end(g[u]), greater<pair<i64, i64>>());
  }
  init_n(dp, n + 1, vector<i64>(1 << n));
  for (i64 u = 1; u <= n; ++u) {
    dfs(u, 0);
  }
  i64 ans = 0;
  for (i64 u = 1; u <= n; ++u) {
    for (i64 d : dp[u]) ans = max(ans, d);
  }
  cout << ans << '\n';
  return 0;
}