#include <bits/stdc++.h>
using namespace std;
template <class T>
inline bool chmax(T &a, T b)
{
    if (a < b)
    {
        a = b;
        return 1;
    }
    return 0;
}
template <class T>
inline bool chmin(T &a, T b)
{
    if (a > b)
    {
        a = b;
        return 1;
    }
    return 0;
}
typedef long long int ll;

#define ALL(v) (v).begin(), (v).end()
#define RALL(v) (v).rbegin(), (v).rend()
#define endl "\n"
const double EPS = 1e-7;
const int INF = 1 << 30;
const ll LLINF = 1LL << 60;
const double PI = acos(-1);
const int MOD = 1000000007;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};

//-------------------------------------

ll dp[100000][20];

int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    int n, m;
    cin >> n >> m;
    vector<vector<int>> g(n, vector<int>(n, 0));
    for (int i = 0; i < m; i++)
    {
        int a, b, c;
        cin >> a >> b >> c;
        g[a][b] = c;
    }
    for (int S = 0; S < (1 << n); S++)
    {
        for (int i = 0; i < n; i++)
        {
            int sub = S & (((1 << n) - 1) ^ (1 << i));
            for (int j = 0; j < n; j++)
            {
                if (sub & (1 << j))
                {
                    chmax(dp[S][i], dp[sub][j]);
                }
            }
            for (int j = 0; j < n; j++)
            {
                if (sub & (1 << j))
                {
                    dp[S][i] += g[j][i];
                }
            }
        }
    }

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