#include <bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
ll INF = 1e18;
ll MOD = 1e9 + 7;

int N, M;
int dp[1<<15];

bool contain(int mask, int pos){
    if((mask & (1<<pos)) != 0) return true;
    return false;
}

int main(){
    cin >> N >> M;
    vector<P> v(M);
    vector<int> score(M);
    
    rep(i,0,M) cin >> v[i].first >> v[i].second >> score[i];
    
    rep(i,0,1<<15) dp[i] = 0;

    rep(mask,1,1<<N) rep(i,0,N){
        if(contain(mask,i)){
            int sum = 0;
            rep(j,0,M){
                if(v[j].second == i && contain(mask, v[j].first)){
                    sum += score[j];
                }
                dp[mask] = max(dp[mask], dp[mask ^ (1<<i)] + sum);
            }
        }
    }

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