#include<bits/stdc++.h>
using namespace std;

int dp[1<<15];
int g[20][20];

int main(){
    memset(dp,0,sizeof(dp));
    int N,M; cin >> N >> M;
    for(int i=0;i<M;i++){
        int a,b,cost;
        cin >> a >> b >> cost;
        g[a][b]=cost;
    }
    for(int msk=0;msk<(1<<N);msk++){
        for(int i=0;i<N;i++){
            if(msk&(1<<i)) continue;
            int sumcost=0;
            for(int j=0;j<N;j++){
                if(msk&(1<<j)) sumcost+=g[j][i];
            }
            dp[msk|(1<<i)]=max(dp[msk|(1<<i)],dp[msk]+sumcost);
        }
        //cout << dp[msk] << endl;
    }
    cout << dp[(1<<N)-1] << endl;
}