#include <algorithm>
#include <vector>
using namespace std;

#define INF 0x3f3f3f3f
#define MAX (1<<18)+5
#define pb push_back
#define DIM 20

int cst[DIM][DIM],bst[DIM][MAX];
vector <int> g[DIM];
int n,m,sol;

void read ()
{
    int i,x,y,z;

    scanf ("%d%d",&n,&m);
    for (i=1; i<=m; ++i)
    {
        scanf ("%d%d%d",&x,&y,&z);
        g[y].pb (x); cst[x][y]=z;
    }
}

void solve ()
{
    vector <int> :: iterator it;
    int stare,i;

    memset (bst,INF,sizeof (bst));
    bst[0][1]=0;
    for (stare=0; stare<(1<<n); ++stare)
        for (i=0; i<n; ++i)
            if (stare&(1<<i))
                for (it=g[i].begin (); it!=g[i].end (); ++it)
                    if (stare&(1<<*it))
                        bst[i][stare]=min (bst[i][stare],bst[*it][stare^(1<<i)]+cst[*it][i]);
    sol=INF;
    for (it=g[0].begin (); it!=g[0].end (); ++it)
        sol=min (sol,bst[*it][(1<<n)-1]+cst[*it][0]);
    if (sol==INF)
        printf ("Nu exista solutie");
    else
        printf ("%d",sol);
}

int main ()
{
    freopen ("hamilton.in","r",stdin);
    freopen ("hamilton.out","w",stdout);

    read ();
    solve ();

    return 0;
}