#include <iostream>
#include <fstream>
#define infinit 1000000000
using namespace std;
ifstream fin("hamilton.in");
ofstream fout("hamilton.out");
int i,j,n,m,cost,nodant,minn,a[20][20],d[262150][20],k;
int main()
{
    fin>>n>>m;
    int minn=infinit;
    for(i=1;i<=m;i++)
    {
        fin>>i>>j>>cost;
        a[i][j]=cost;
    }
    for(i=3;i<(1<<n);i=i+2)
    {
        for(j=0;j<n;j++)
        {
            d[i][j]=infinit;
            if(((1<<j)&i)!=0)
            {
                nodant=i-(1<<j);
                for(k=0;k<n;k++)
                {
                    if((nodant&(1<<k))!=0&&a[k][j]!=0)
                    {
                        d[i][j]=min(d[i][j],d[nodant][k]+a[k][j]);
                    }
                }
            }
        }
    }
   /* for(i=1;i<=(1<<n)-1;i++)
    {
        for(j=0;j<n;j++)
        {
            cout<<d[i][j]<<" ";
        }
        cout<<endl;
    }
    cout<<endl<<endl;
    for(i=0;i<n;i++)
    {
       for(j=0;j<n;j++)
       {
           cout<<a[i][j]<<" ";
       }
       cout<<endl;
    }
   /*4 7
0 1 5
0 2 2
1 2 6
1 3 4
2 1 5
2 3 7
3 0 3*/

    nodant=(1<<n)-1;
    for(i=0;i<n;i++)
    {
        if(a[i][0]!=0)
        {
            if(minn>d[nodant][i]+a[i][0])
            {
                minn=d[nodant][i]+a[i][0];
            }
        }
    }
    if(minn!=infinit)
    {
        fout<<minn;
    }
    else
    {
        fout<<"Nu exista solutie";
    }
    return 0;
}