#include<fstream>
using namespace std;
const int MAXN=20;
const int MAXE=(1<<20);
const int INF=(1<<30)-1;
int n,m,SOL;
int C[MAXE][MAXN];
int G[MAXN][MAXN];
void read()
{
    ifstream fin("hamilton.in");
    fin>>n>>m;
    int i,j;
    for (i=1; i<=m; ++i)
    {
        int x,y,z;
        fin>>x>>y>>z;
        G[x][y]=z;
    }
    fin.close();
}
void write()
{
    ofstream fout("hamilton.out");

    if (SOL==INF)
        fout<<"Nu exista solutie\n";
    else
        fout<<SOL<<'\n';

    fout.close();
}
void init()
{
    int i,j,k;
        for (j=0; j<(1<<n); ++j)
            for (k=0; k<n; ++k)
                C[j][k]=INF;
}
int solve()
{
    init();
    int i,j,k,v;
    //CAZ DE BAZA
    C[1][0]=0;

    //RECURENTA
    for (i=0; i<(1<<n); ++i)
        for (j=0; j<n; ++j)
            if (i&(1<<j))
                for (k=0; k<n; ++k)
                    if (i&(1<<k) && G[k][j])
                        C[i][j]=min(C[i][j], C[i ^ (1<<j)][k]+G[k][j]);
    //AFISAREA SOLUTIEI
    SOL=INF;
    for (i=0; i<n; ++i)
    {
        if (G[i][0]!=INF && G[i][0])
        {
            if (SOL>C[(1<<n)-1][i]+G[i][0])
                SOL=C[(1<<n)-1][i]+G[i][0];
        }
    }
}
int main()
{
    read();
    solve();
    write();
    return 0;
}