#include <cstdio>
#define INF 0x3f3f3f3f
#include <vector>
#include <cstring>
#include <algorithm>

using namespace std;

int N,M,COST[20][20],Rez=INF,C[20][20];
vector <int> G[20];

int Part(int arg1,int arg2,int arg3){
    if(C[arg2][arg3] == -1){
        C[arg2][arg3] = INF;
        int l;
        for(size_t i = 0;i < G[arg3].size();++i)
            if(arg2 & (1<<G[arg3][i])){
                if(G[arg3][i] == arg1 && ((arg2 ^ (1<<arg3)) != (1<<arg3)))continue;
                C[arg2][arg3] = min(C[arg2][arg3],Part(arg1,arg2 ^ (1 << arg3),G[arg3][i]) + COST[G[arg3][i]][arg3]);
            }
    }
    return C[arg2][arg3];
}

int main(){
    freopen("hamilton.in","r",stdin);
    freopen("hamilton.out","w",stdout);
    int i,j,k;
    scanf("%d %d ",&N,&M);
    for(i=0;i<N;++i)
        for(j=0;j<N;++j)COST[i][j] = INF;
    while(M--){
        scanf("%d %d %d ",&i,&j,&k);
        G[j].push_back(i);
        COST[i][j] = k;
    }
    Rez = INF;
    for(i=0;i<N;++i){
        memset(C,-1,sizeof(C));
        C[1<<i][i] = 0;
        ///Es ist unmoglich ohne Recursivitat;
        for(size_t it = 0;it < G[i].size();++it)Rez = min(Rez,Part(i,(1<<N)-1,G[i][it]) + COST[G[i][it]][i]);
    }
    if(Rez != INF)printf("%d\n",Rez);
    else printf("Nu exista solutie\n");
    return 0;
}