#include <bits/stdc++.h>

#define REP(i, n) for (int i = 0; i < (n); i++)
#define FOR(i, init, n) for (int i = init; i < (n); i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define fi first
#define se second

using namespace std;
using ll = long long int;
using P = pair<int, int>;
using T = tuple<int, int, int>;
using edge = struct
{
    int to, cost;
};

const int MOD = 1e9 + 7;
const int iINF = 1e9;
const long long int llINF = 1e18;
const double PI = acos(-1.0);

const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};

bool graph[16][16];
ll dp[1 << 16];

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

    int N, M;
    cin >> N >> M;

    vector<int> score(M), a(M), b(M);

    REP(i, M)
    {
        cin >> a[i] >> b[i] >> score[i];
    }

    dp[0] = 0;

    REP(S, 1 << N)
    {

        REP(i, N)
        {
            if ((S >> i) & 1) 
                continue;

            ll sum = 0;

            REP(j, M)
            {
                if (a[j] == i && ((S >> b[j]) & 1))
                {
                    sum += score[j];
                }
            }

            dp[S | 1 << i] = max(dp[S | 1 << i], dp[S] + sum);
        }
    }

    cout << dp[(1 << N) - 1] << endl;

    return 0;
}