#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef pair<ll, ll> p_ll;

template<class T>
void debug(T itr1, T itr2) { auto now = itr1; while(now<itr2) { cout << *now << " "; now++; } cout << endl; }
#define repr(i,from,to) for (ll i=(ll)from; i<(ll)to; i++)
#define all(vec) vec.begin(), vec.end()
#define rep(i,N) repr(i,0,N)
#define per(i,N) for (int i=(int)N-1; i>=0; i--)

const ll MOD = pow(10,9)+7;
const ll LLINF = pow(2,61)-1;
const int INF = pow(2,30)-1;

vector<ll> fac;
void c_fac(int x=pow(10,6)+10) { fac.resize(x,true); rep(i,x) fac[i] = i ? (fac[i-1]*i)%MOD : 1; }
ll inv(ll a, ll m=MOD) { ll b = m, x = 1, y = 0; while (b!=0) { int d = a/b; a -= b*d; swap(a,b); x -= y*d; swap(x,y); } return (x+m)%m; }
ll nck(ll n, ll k) { return fac[n]*inv(fac[k]*fac[n-k]%MOD)%MOD; }
ll gcd(ll a, ll b) { if (a<b) swap(a,b); return b==0 ? a : gcd(b, a%b); }
ll lcm(ll a, ll b) { return a/gcd(a,b)*b; }

vector<vector<ll>> d, ma;

ll N, M;
ll dfs(ll n, ll m) {
  if (ma[n][m]!=-1) return ma[n][m];

  ll newp = n - (1<<m);
  bool used = false;
  rep(i,N) {
    if (d[m][i]&&(n&(1<<i))) {
      used = true;
      ma[n][m] = max(ma[n][m], dfs(newp,i)+d[m][i]);
    }
  }
  if (!used) ma[n][m] = 0;
  // cout << n << "," << m << "->" << ma[n][m] << endl;
  return ma[n][m];
}

int main() {
  cin >> N >> M;
  d.resize(N); rep(i,N) d[i].resize(N);
  rep(i,M) {
    ll a, b, c; cin >> a >> b >> c; a--; b--;
    d[a][b] = max(d[a][b],c);
    d[b][a] = max(d[b][a],c);
  }
  // rep(i,N) debug(all(d[i]));
 
  ma.resize(1<<N); rep(i,1<<N) ma[i].resize(N,-1);
  rep(i,N) dfs((1<<N)-1, i);

  ll result = 0; rep(i,N) result = max(result, ma[(1<<N)-1][i]);
  cout << result << endl;
  return 0;
}