#include<bits/stdc++.h>
using namespace std;
#define ALL(x) x.begin(),x.end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define INF 1000000000
#define mod 1000000007
using ll=long long;
const ll LINF=1001002003004005006ll;
int dx[]={1,0,-1,0};
int dy[]={0,1,0,-1};
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}
template<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return true;}return false;}

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

    int n,m;cin>>n>>m;
    ll g[n][n];
    rep(i,n)rep(j,n) g[i][j]=-1;
    rep(i,m){
        int u,v;ll c;cin>>u>>v>>c;u--,v--;
        chmax(g[u][v],c);
        chmax(g[v][u],c);
    }
    ll dp[1<<n][n]={};
    for(int bit=0;bit<(1<<n);bit++){
        for(int u=0;u<n;u++)if((bit>>u)&1){
            for(int v=0;v<n;v++)if(u!=v and ((bit>>v)&1)==0){
                if(g[u][v]>=0) chmax(dp[bit+(1<<v)][v],dp[bit][u]+g[u][v]);
            }
        }
    }
    ll ans=0;
    for(int bit=0;bit<(1<<n);bit++){
        for(int k=0;k<n;k++) chmax(ans,dp[bit][k]);
    }
    cout<<ans<<endl;
    return 0;
}