#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("hamilton.in");
ofstream g("hamilton.out");
int n,m,c[20][20],mc=1999999999;
bool v[20];
void sem(int i,int cr,int cc)
{
    v[i]=1;
    if(n==cr){if(c[i][1]<1000001)mc=min(mc,cc+c[i][1]);}
    else{
    for(int j=0;j<=n;++j)if((!v[j])&&c[i][j]<=1000000)sem(j,cr+1,cc+c[i][j]);}
    v[i]=0;
}
int main()
{
    f>>n>>m;
    for(int i=0;i<=n;++i)for(int j=0;j<=n;++j)c[i][j]=1000001;
    for(int i=1;i<=m;++i){int x,y,t;f>>x>>y>>t;c[x][y]=t;}
    sem(1,1,0);
    if(mc<1999999999)g<<mc;
    else g<<"Nu exista solutie";
}