#include <iostream>
#include <string>
#include <queue>
#include <stack>
#include <algorithm>
#include <list>
#include <vector>
#include <complex>
#include <utility>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <bitset>
#include <ctime>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <cassert>
#include <cstddef>
#include <iomanip>
#include <numeric>
#include <tuple>
#include <sstream>
#include <fstream>

#define REP(i,n) for(int (i)=0;(i)<(n);(i)++)
#define FOR(i,a,b) for(int (i)=(a);(i)<(b);(i)++)
#define RREP(i,a) for(int (i)=(a)-1;(i)>=0;(i)--)
#define FORR(i,a,b) for(int (i)=(a)-1;(i)>=(b);(i)--)
#define PI acos(-1.0)
#define DEBUG(C) cout<<C<<endl;
#define VI vector<int>
#define VII vector<VI>
#define VL vector<LL>
#define VLL vector<VL>
#define VD vector<double>
#define VDD vector<VD>
#define PII pair<int,int>
#define PDD pair<double,double>
#define PLL pair<LL,LL>
#define VPII vector<PII>
#define ALL(a) (a).begin(),(a).end()
#define SORT(a) sort(ALL(a))
#define REVERSE(a) reverse(ALL(a))
#define MP make_pair
#define EP emplace_back
#define FORE(a,b) for(auto &&a:b)

using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
const int INF=1e9;
const int MOD=INF+7;

int N,M;
VII vv;
void make(set<int> s,VI v){
    if(s.size()==N){
        vv.emplace_back(v);
        return;
    }
    FOR(i,1,N+1){
        if(s.find(i)!=s.end()) continue;
        auto vbuf=v;
        auto sbuf=s;
        vbuf.emplace_back(i);
        sbuf.insert(i);
        make(sbuf,vbuf);
    }
}

void out(VII VV){
    FORE(V,VV){
        FORE(v,V) cout<<v<<" ";
        cout<<endl;
    }
    cout<<"size = "<<VV.size()<<endl;
}

int main(void){
    cin >> N >> M;
    vector<pair<PII,int>> item(M);
    REP(i,M){
        int a,b,c;
        cin >> a >> b >> c;
        item[i]=MP(MP(a,b),c);
    }
    set<int> s;VI vec;
    make(s,vec);
    int ans=0;
    FORE(v,vv){
        int sum=0;
        FORE(it,item){
            bool f=false;
            FORE(el,v){
                if(el==it.first.first+1) f=true;
                if(el==it.first.second+1) f=false;
            }
            if(!f) sum+=it.second;
        }
        ans=max(ans,sum);
    }
    //out(vv);
    cout<<ans<<endl;
}