#include<stdio.h>
#include<vector>
#include<set>
#include<string.h>
#define INF=
using namespace std;

vector<int> T[20];
vector<int> cosst[20];

int viz[19],n,m,sol=1000000000;


void read()
{
    scanf("%d %d",&n,&m);
    int i,x,y,c;
    for(i=1;i<m+1;i++)
    {
        scanf("%d %d %d",&x,&y,&c);
        T[x].push_back(y);
        cosst[x].push_back(c);
    }
}

void dfs(int k,int cost,int nr)
{
    viz[k]=1;
  //  printf("%d \n",cost);

    vector<int>::iterator it,it2;
    it2=cosst[k].begin();

    for(it=T[k].begin();it != T[k].end();it++, it2++)
    {
        if(!viz[*it]) dfs(*it,cost + *it2,nr+1);
        if(*it==0 && nr==n && cost + *it2 < sol) sol = cost + *it2;
    }
    viz[k]=0;
}

int main()
{
    freopen("hamilton.in","r",stdin);
    freopen("hamilton.out","w",stdout);
    read();
    dfs(0,0,1);
    if (sol == 1000000000){
        printf("Nu exista solutie");return 0;}
    printf("%d \n",sol);
    return 0;
}