//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = int64_t;
using ld = long double;
using P = pair<int, int>;
using vs = vector<string>;
using vi = vector<int>;
using vvi = vector<vi>;
template<class T> using PQ = priority_queue<T>;
template<class T> using PQG = priority_queue<T, vector<T>, greater<T> >;
const int INF = 0xccccccc;
const ll LINF = 922337203685477580LL;
template<typename T1, typename T2>
inline bool chmax(T1 &a, T2 b) {return a < b && (a = b, true);}
template<typename T1, typename T2>
inline bool chmin(T1 &a, T2 b) {return a > b && (a = b, true);}
template<typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) { return is >> p.first >> p.second;}
template<typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) { return os << p.first << ' ' << p.second;}



const int N = 20;
const int X = 1<<17;

//head

int n, m;
int dist[N][N];
int dp[X][N];
int ans = 0;

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cin >> n >> m;

  rep(i, n) fill(dist[i], dist[i]+n, -INF);

  rep(i, m) {
    int a, b, c;
    cin >> a >> b >> c;
    a--; b--;
    chmax(dist[a][b], c);
    dist[b][a] = dist[a][b];
  }
  rep(i, 1<<n) fill(dp[i], dp[i]+n, -INF);

  int cnt = 0;
  rep(i, 1<<n) {
    if(__builtin_popcount(i) < 2) {
      if(i) {
        dp[i][cnt++] = 0;
      }
      continue;
    }
    rep(j, n) if(i>>j&1) {
      int u = i^(1<<j);
      rep(k, n) if(u>>k&1) {
        chmax(dp[i][j], dp[u][k] + dist[j][k]);
      }
      chmax(ans, dp[i][j]);
    }
  }

  cout << ans << endl;
}