#include <iostream>
#include <stdio.h>
#include <vector>

#define NMAX 18
#define INFINIT 1000000000

using namespace std;

struct muchie {
  int to ;
  int cost ;
};

int mat [ NMAX + 1 ] [ NMAX + 1 ] ;
int d [ 1 << (NMAX+1)] [ NMAX + 1 ] ;
vector <int> g [ NMAX + 1 ] ;

class InParser {
private:
	FILE *fin;
	char *buff;
	int sp;

	char read_ch() {
		++sp;
		if (sp == 4096) {
			sp = 0;
			fread(buff, 1, 4096, fin);
		}
		return buff[sp];
	}

public:
	InParser(const char* nume) {
		fin = fopen(nume, "r");
		buff = new char[4096]();
		sp = 4095;
	}

	InParser& operator >> (int &n) {
		char c;
		while (!isdigit(c = read_ch()) && c != '-');
		int sgn = 1;
		if (c == '-') {
			n = 0;
			sgn = -1;
		} else {
			n = c - '0';
		}
		while (isdigit(c = read_ch())) {
			n = 10 * n + c - '0';
		}
		n *= sgn;
		return *this;
	}

	InParser& operator >> (long long &n) {
		char c;
		n = 0;
		while (!isdigit(c = read_ch()) && c != '-');
		long long sgn = 1;
		if (c == '-') {
			n = 0;
			sgn = -1;
		} else {
			n = c - '0';
		}
		while (isdigit(c = read_ch())) {
			n = 10 * n + c - '0';
		}
		n *= sgn;
		return *this;
	}
};


class OutParser {
private:
    FILE *fout;
    char *buff;
    int sp;

    void write_ch(char ch) {
        if (sp == 50000) {
            fwrite(buff, 1, 50000, fout);
            sp = 0;
            buff[sp++] = ch;
        } else {
            buff[sp++] = ch;
        }
    }


public:
    OutParser(const char* name) {
        fout = fopen(name, "w");
        buff = new char[50000]();
        sp = 0;
    }
    ~OutParser() {
        fwrite(buff, 1, sp, fout);
        fclose(fout);
    }

    OutParser& operator << (int vu32) {
        if (vu32 <= 9) {
            write_ch(vu32 + '0');
        } else {
            (*this) << (vu32 / 10);
            write_ch(vu32 % 10 + '0');
        }
        return *this;
    }

    OutParser& operator << (long long vu64) {
        if (vu64 <= 9) {
            write_ch(vu64 + '0');
        } else {
            (*this) << (vu64 / 10);
            write_ch(vu64 % 10 + '0');
        }
        return *this;
    }

    OutParser& operator << (char ch) {
        write_ch(ch);
        return *this;
    }
    OutParser& operator << (const char *ch) {
        while (*ch) {
            write_ch(*ch);
            ++ch;
        }
        return *this;
    }
};

int main() {

  InParser fin("hamilton.in") ;
  OutParser fout("hamilton.out") ;
  int n, m, i, u, v, cost, j, minim, mask, nod ;
  fin >> n >> m ;
  for (i = 0 ; i < n ; ++i ) {
    for (j = 0 ; j < n ; ++j )
      mat[i][j] = INFINIT ;
  }
  for (i = 0 ; i < m ; ++i ) {
    fin >> u >> v >> cost ;
    mat[u][v] = cost ; /// muchiile invers
    g[v].push_back(u) ;
  }
  for (i = 0 ; i < (1 << n) ; ++i ) {
    for (j = 0 ; j < n ; ++j )
      d[i][j] = INFINIT ;
  }
  minim = INFINIT ;
  d[1][0] = 0 ;
  for (mask = 0 ; mask < 1 << n ; ++mask ) {
    for (nod = 0 ; nod < n ; ++nod ) {
      for (auto elem : g[nod] ) {
        if (mask & (1 << elem)) {
          if (!(mask != (1 << nod) + 1 && mat[0][elem] == 0 ) )
            d[mask][nod] = std::min(d[mask][nod], d[mask ^ (1 << nod)][elem] + mat[elem][nod]) ;
        }
      }
    }
  }
  for (auto elem : g[0] )
    minim = std::min(minim, d[(1 << n) - 1][elem] + mat[elem][0] ) ;
  if (minim == INFINIT )
    fout << "Nu exista solutie" ;
  else
    fout << minim ;
  return 0;
}