#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <string>
#include <map>
#include <set>
#include <stack>
#include <tuple>
#include <deque>
#include <array>
#include <numeric>
#include <bitset>
#include <iomanip>
#include <cassert>
#include <chrono>
#include <random>
#include <limits>
#include <iterator>
#include <functional>
#include <sstream>
#include <fstream>
#include <complex>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
using namespace std;

using ll = long long;
constexpr int INF = 1001001001;
constexpr int mod = 1000000007;
// constexpr int mod = 998244353;

template<class T>
inline bool chmax(T& x, T y){
    if(x < y){
        x = y;
        return true;
    }
    return false;
}
template<class T>
inline bool chmin(T& x, T y){
    if(x > y){
        x = y;
        return true;
    }
    return false;
}

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

    int n, m;
    cin >> n >> m;
    vector<vector<pair<int, int>>> g(n);
    for(int i = 0; i < m; ++i){
        int a, b, c;
        cin >> a >> b >> c;
        --a, --b;
        g[a].emplace_back(b, c);
        g[b].emplace_back(a, c);
    }

    vector<vector<int>> dp(1 << n, vector<int>(n, -1));
    for(int i = 0; i < n; ++i)  dp[1 << i][i] = 0;
    for(int mask = 1; mask < 1 << n; ++mask){
        for(int i = 0; i < n; ++i){
            if(dp[mask][i] == -1)   continue;
            for(auto [j, cost] : g[i]){
                if(mask >> j & 1)   continue;
                chmax(dp[mask | (1 << j)][j], dp[mask][i] + cost);
            }
        }
    }

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

    return 0;
}