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

typedef long long ll;
typedef vector< int > vi;
typedef vector< vi > vvi;
typedef vector< ll > vl;
typedef vector< vl > vvl;
typedef pair< int, int > pii;
typedef vector< pii > vp;
typedef vector< double > vd;
typedef vector< vd > vvd;
typedef vector< string > vs;

template< class T1, class T2 >
int upmin( T1 &x, T2 v ){
  if( x > v ){
    x = v;
    return 1;
  }
  return 0;
}

template< class T1, class T2 >
int upmax( T1 &x, T2 v ){
  if( x < v ){
    x = v;
    return 1;
  }
  return 0;
}

const int INF = 0x3f3f3f3f;

int N, M;
vi item1, item2, score;

void init(){
  cin >> N >> M;
  item1 = item2 = score = vi( M );
  for( int i = 0; i < M; ++i )
    cin >> item1[ i ] >> item2[ i ] >> score[ i ];
}

vvi dp;

void preprocess(){
  dp = vvi( 1 << N, vi( N, -INF ) );
  for( int i = 0; i < N; ++i ){
    dp[ 1 << i ][ i ] = 0;
    for( int j = 0; j < M; ++j )
      if( item1[ j ] == i )
        dp[ 1 << i ][ i ] += score[ j ];
  }     
  for( int i = 0; i < 1 << N; ++i )
    for( int j = 0; j < N; ++j )
      if( dp[ i ][ j ] >= 0 ){
        // cout << "dp[ " << i << " ][ " << j << " ] = " << dp[ i ][ j ] << endl;
        for( int k = 0; k < N; ++k )
          if( ~i & 1 << k ){
            int v = 0;
            for( int l = 0; l < M; ++l )
              if( item1[ l ] == k and ( ~i & 1 << item2[ l ] ) )
                v += score[ l ];
            upmax( dp[ i | 1 << k ][ k ], dp[ i ][ j ] + v );
          }
      }
}

void solve(){
  int ans = 0;
  for( int i = 0; i < N; ++i )
    upmax( ans, dp[ ( 1 << N ) - 1 ][ i ] );
  cout << ans << endl;
}

signed main(){
  ios::sync_with_stdio( 0 );
  init();
  preprocess();
  solve();
  return 0;
}