#include <bits/stdc++.h>
using namespace std;
using i64=int_fast64_t;
using pii=pair<int,int>;
template <class T> constexpr T inf=numeric_limits<T>::max() / (T)2;
template <class T> using minheap=priority_queue<T,vector<T>,greater<T>>;
#define fir first
#define sec second
#define mkp make_pair
#define mkt make_tuple
#define emb emplace_back
#define all(v) begin(v),end(v)
i64 binry(i64 ok, i64 ng, const function<bool(i64)> &f) {
    while(abs(ok-ng)>1) {
        i64 mid=(ok+ng)/2;
        (f(mid) ? ok : ng) = mid;
    }
    return ok;
}

int n,m;
int di[20][20];
int dp[1<<16][17];

signed main() {
    cin>>n>>m;

    for(int i=0; i<n; ++i) {
        for(int j=0; j<i; ++j) {
            di[i][j]=di[j][i]=-1e9;
        }
    }
    for(int i=0; i<m; ++i) {
        int u,v,c; cin>>u>>v>>c;
        --u,--v;
        di[v][u]=di[u][v]=max(di[u][v],c);
    }

    for(int i=0; i<n; ++i) {
        for(int s=0; s<1<<n; ++s) {
            dp[s][i]=-1e9;
        }
    }
    for(int i=0; i<n; ++i) dp[1<<i][i]=0;

    for(int h=0; h<1<<n; ++h) {
        for(int j=0; j<n; ++j) {
            if(h>>j&1) continue;
            for(int k=0; k<n; ++k) {
                if(h>>k&1) {
                    dp[h|1<<j][j]=max(dp[h|1<<j][j],dp[h][k]+di[k][j]);
                }
            }
        }
    }

    int ans=0;
    for(int i=0; i<n; ++i) {
        for(int h=0; h<1<<n; ++h) {
            ans=max(ans,dp[h][i]);
        }
    }
    cout<<ans<<endl;
}