package main

import (
	"fmt"
	"strconv"
)

func scan() (N int, M int, scoreMap map[string]int) {
	scoreMap = map[string]int{}
	fmt.Scan(&N, &M)
	for i := 0; i < M; i++ {
		var item1, item2 string
		var score int
		fmt.Scan(&item1, &item2, &score)
		key := item1 + "," + item2
		scoreMap[key] = score
	}
	return
}

// func permutaions(n int, arr []int) (res [][]int) {
// 	res = append(res, arr)
// 	return
// }

func generate(n int, arr []int, perms *[][]int) {
	if n == 1 {
		cpy := make([]int, len(arr))
		copy(cpy, arr)
		*perms = append(*perms, cpy)
		return
	} else {
		for i := 0; i < n; i++ {
			generate(n-1, arr, perms)
			if n%2 == 0 {
				arr[i], arr[n-1] = arr[n-1], arr[i]
			} else {
				arr[0], arr[n-1] = arr[n-1], arr[0]
			}
		}
	}
}

func main() {
	N, _, scoreMap := scan()
	// N, _, scoreMap := 4, 9, map[string]int{
	// 	"0,1": 1,
	// 	"0,2": 2,
	// 	"0,3": 3,
	// 	"1,2": 4,
	// 	"1,3": 5,
	// 	"2,3": 6,
	// 	"3,2": 100,
	// 	"2,1": 100,
	// 	"1,0": 100,
	// }

	var items []int
	for i := 0; i < N; i++ {
		items = append(items, i)
	}
	perms := [][]int{}
	generate(N, items, &perms)

	var maxScore int

	for _, p := range perms {
		score := 0
		for i := 0; i < len(p)-1; i++ {
			comb := strconv.Itoa(p[i]) + "," + strconv.Itoa(p[i+1])
			score += scoreMap[comb]
		}
		if score > maxScore {
			maxScore = score
		}
	}

	fmt.Print(maxScore)
}