#include "bits/stdc++.h"
#define REP(i,n,N) for(int i=(n); i<(N); i++)
#define RREP(i,n,N) for(ll i=(N-1); i>=n; i--)
#define CK(n,a,b) ((a)<=(n)&&(n)<(b))
#define ALL(v) (v).begin(),(v).end()
#define p(s) cout<<(s)<<endl
#define p2(a,b) cout<<(a)<<" "<<(b)<<endl
#define v2(T) vector<vector<T>>
typedef long long ll;
using namespace std;
const ll mod=1e9+7;
const ll inf=1e18;

int score[15][15];
int dp[1<<14];
int main() {
    int n,m;
    cin>>n>>m;
    REP(i,0,m){
        int a,b,c;
        cin>>a>>b>>c;
        score[a][b]=c;
    }
    REP(mask,0,1<<n){
        vector<int> vt;
        REP(i,0,n){
            if(mask & (1<<i)) vt.push_back(i);
        }
        REP(i,0,n){
            if(!(mask & (1<<i))){
                int tmp=0;
                for(auto v:vt){
                    tmp += score[i][v];
                }
                dp[mask | (1<<i)] = max(dp[mask|(1<<i)], dp[mask] + tmp);
            }
        }
    }
    p(dp[(1<<n)-1]);
    return 0;
}