#include <cstdio>
#include <vector>
#include <algorithm>
#define nmax 20
#define inf 1<<30
using namespace std;
FILE *f=fopen("hamilton.in","r"),*g=fopen("hamilton.out","w");
struct muc{
    int c; long long d;
};
vector <muc> l[nmax];
long long best[1<<nmax][nmax];
long long hami(long long biti, int nod)
{
    if(best[biti][nod]!=0)
        return best[biti][nod];
    if(biti==1&&nod==0)
        return 0;
    int i,j,x;
    long long val=inf;
    for(i=0;i<l[nod].size();i++)
    {
        x=l[nod][i].d;

        if(biti&(1<<x)&&x!=0)
        {
            val=min(val,hami(biti xor 1<<nod, x)+l[nod][i].c);
        }
        else if(x==0&&biti==(1<<nod)+1)
        {
            val=min(val,hami(biti xor 1<<nod, x)+l[nod][i].c);
        }
    }
    best[biti][nod]=val;
    return val;
}
int main()
{
    int i,j,n,m,x,y; long long val=0; muc aux; char s[30],*t;
    fscanf(f,"%d %d",&n,&m);
    for(i=1;i<=m;i++)
    {
        fscanf(f,"%d %d %d",&x,&y,&aux.c);
        aux.d=y;
        l[x].push_back(aux);
    }
    fclose(f);
    val=inf;
    for(i=0;i<l[0].size();i++)
    {
        val=min(val,
                hami((1<<n)-1,l[0][i].d)+l[0][i].c);
    }
    if(val<inf)
    fprintf(g,"%lld",val);
    else
        fprintf(g,"Nu exista solutie");
    fclose(g);
    return 0;
}