#include <iostream>
#include <cstring>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <set>
#include <utility>
#include <cstdlib>
#include <queue>
#include <stack>
#include <iomanip>
#include <cstdio>
#include <map>
#include <list>

using namespace std;

typedef long long Int;
typedef pair<Int,Int> P;

#define rep(i,x) for(Int i = 0; i < (Int)(x); i++)
#define rrep(i,x) for(Int i = ((Int)(x) - 1); i >= 0; i--)
#define _upgrade ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define all(x) (x).begin(), (x).end()
#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );
#define pb push_back
#define MX 100010


template<class T1, class T2> void chmin(T1 &a, T2 b){if(a>b)a=b;}
template<class T1, class T2> void chmax(T1 &a, T2 b){if(a<b)a=b;}

//ll gcd(ll a, ll b){return b?gcd(b,a%b):a;}
//ll lcm(ll x, ll y) {return x / gcd(x, y) * y;}

Int dx[4] = {1,0,-1,0};
Int dy[4] = {0,1,0,-1};
//const Int INF = 1001002003004005006ll;
const Int mod = 1e9 + 7;
const double PI = 3.14159265358979323846;


// ****************************************CODE***************************************//



constexpr Int INF = 1e10;




int main()
{
        int n, m;
        cin >> n >> m;
        vector<vector<int>> d(n, vector<int>(n, -INF));
        for(int i = 0; i < m; i++)
        {
                int a, b, c;
                cin >> a >> b >> c;
                a--;
                b--;
                chmax(d[a][b], c);
                chmax(d[b][a], c);
        }

        vector<vector<Int>> dp(n, vector<Int>(1<<n, -INF));
        for(int i = 0; i < n; i++)
        {
                dp[i][1<<i] = 0;
        }
        Int ret = 0;
        for(int s = 0; s < (1<<n); s++)
        {
                for(int D = 0; D < n; D++)
                {
                        if((1<<D) & s)
                        {
                                for(int dd = 0; dd < n; dd++)
                                {
                                        if(!((1<<dd) & s) and d[D][dd] > 0)
                                        {
                                                chmax(dp[dd][s ^ (1<<dd)], dp[D][s] + d[D][dd]);
                                                chmax(ret,dp[dd][s ^ (1<<dd)]);
                                        }
                                }
                        }
                }
        }
        cout << ret << endl;
        return 0;
}