#include <atcoder/all>
#include <bits/stdc++.h>
using namespace std;
using namespace atcoder;
#define rep(i, n) REP(i, 0, n)
#define REP(i, s, e) for (int i = (s); i < (int)(e); i++)
#define repr(i, n) REPR(i, n, 0)
#define REPR(i, s, e) for (int i = (int)(s - 1); i >= (int)(e); i--)
#define all(r) r.begin(), r.end()
#define rall(r) r.rbegin(), r.rend()

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;

template <typename T, typename U>
T chmax(T& a, const U& b) {
    if (a >= b) return false;
    a = b;
    return true;
}
template <typename T, typename U>
T chmin(T& a, const U& b) {
    if (a <= b) return false;
    a = b;
    return true;
}

void yes_no(bool f, string yes = "Yes", string no = "No") { cout << (f ? yes : no) << "\n"; }

void solve() {
    int n, m;
    cin >> n >> m;
    vector<vl> s(n, vl(n, 0LL));
    rep(i, m) {
        int a, b, c;
        cin >> a >> b >> c;
        s[a][b] = c;
    }
    const ll inf = 1e18;
    vl dp(1 << n, -inf);
    dp[0] = 0;
    rep(mask, 1 << n) {
        rep(i, n) {
            if (mask & (1 << i)) continue;
            ll x = 0;
            rep(j, n) if (mask & (1 << j)) x += s[j][i];
            chmax(dp[mask | (1 << i)], dp[mask] + x);
        }
    }
    ll ans = dp.back();
    cout << ans << "\n";
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int t = 1;
    // cin >> t;
    rep(ti, t) solve();
    return 0;
}