#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;

#define fi first
#define se second
#define repl(i,a,b) for(ll i=(ll)(a);i<(ll)(b);i++)
#define rep(i,n) repl(i,0,n)
#define all(x) (x).begin(),(x).end()
#define dbg(x) cout<<#x"="<<x<<endl
#define mmax(x,y) (x>y?x:y)
#define mmin(x,y) (x<y?x:y)
#define maxch(x,y) x=mmax(x,y)
#define minch(x,y) x=mmin(x,y)
#define uni(x) x.erase(unique(all(x)),x.end())
#define exist(x,y) (find(all(x),y)!=x.end())
#define bcnt __builtin_popcountll

#define INF 1e16
#define mod 1000000007

ll N,M;
ll d[22][22];
ll dp[(1<<16)][16];

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

  cin>>N>>M;
  rep(i,N)rep(j,N)if(i!=j)d[i][j]=-INF;
  rep(i,M){
    ll a,b,c;
    cin>>a>>b>>c;
    a--;b--;
    maxch(d[a][b],c);
    maxch(d[b][a],c);
  }

  rep(S,(1<<N))rep(i,N)dp[S][i]=-INF;
  rep(i,N)dp[(1<<i)][i]=0;

  ll res=0;
  rep(S,(1<<N))rep(i,N){
    maxch(res,dp[S][i]);
    rep(j,N){
      if((S>>j)&1)continue;
      if(d[i][j]==-INF)continue;
      maxch(dp[(S|(1<<j))][j],dp[S][i]+d[i][j]);
    }
  }
  cout<<res<<endl;

  return 0;
}