#include <bits/stdc++.h>
using namespace std;
int main(){
	int n,m;	cin>>n>>m;
	vector<int> i1(m),i2(m),scr(m);
	for(int i=0;i<m;i++){
		cin>>i1[i]>>i2[i]>>scr[i];
	}
	vector<int> per;
	for(int i=0;i<n;i++)	per.push_back(i);
	int maxscr=0,cnt;
	do{
		cnt=0;
		for(int i=0;i<m;i++){
			int lo1=-1,lo2=-1;
			for(int j=0;j<n;j++){
				if(i1[i]==per[j])	lo1=j;
				if(i2[i]==per[j])	lo2=j;
			}
			if(lo1<lo2)	cnt+=scr[i];
		}
		maxscr=max(maxscr,cnt);
	}while(next_permutation(per.begin(),per.end()));
	cout<<maxscr<<endl;
	return 0;
}