#include <fstream>
using namespace std;
ifstream fin("hamilton.in");
ofstream fout("hamilton.out");
const int INF = 100000000;
const int MAXN = 20;
int N, M, Sol, P[MAXN], U[MAXN], C[MAXN][MAXN];
void Back(int k){
	if(k > N){
		int res = C[P[N]][P[1]];
		for(int i = 1; i < N; ++i)
			res += C[P[i]][P[i+1]];
		Sol = min(Sol, res);
		return;
	}
	for(int i = 0; i < N; ++i)
		if(!U[i]){
			U[i] = 1;
			P[k] = i;
			Back(k + 1);
			U[i] = 0;
		}
}
int main(){
	fin >> N >> M;
	Sol = INF;
	for(int i = 0; i < N; ++i)
		for(int j = 0; j < N; ++j) C[i][j] = INF;
	for(int i = 1; i <= M; ++i){
		int x, y;
		fin >> x >> y;
		fin >> C[x][y];
	}
	Back(1);
	if(Sol == INF)
        fout << "Nu exista solutie" << endl;
	else
	    fout << Sol << endl;
	return 0;
}