#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream in("hamilton.in");
ofstream out("hamilton.out");
vector <pair <int,int> > v[20];
vector <pair <int,int> > vi[20];
int n,x,y,cst,m;
int dp[300000][20];
int main()
{
    in>>n>>m;
    for(int i=1;i<=m;i++)
    {
        in>>x>>y>>cst;
        v[x].push_back({cst,y});
        vi[y].push_back({cst,x});
    }
    int inf=1e9;
    for(int i=0;i<(1<<(n-1));i++)
        for(int j=0;j<n;j++)
        dp[i][j]=inf;
    for(auto it : v[0])
        dp[1<<(it.second-1)][it.second]=it.first;
    for(int i=3;i<(1<<(n-1));i++)
            for(int k=0;k<n;k++)
            if(i & (1<<k))
    {
        //for(int j=1;j<n;j++)
            for(auto it : vi[k+1])
                dp[i][k+1]=min(dp[i][k+1],dp[i ^ (1<<k)][it.second]+it.first);
    }
    int sol=inf;
    /*for(int i=0;i<(1<<(n-1));i++)
        {for(int j=1;j<n;j++)
        if(dp[i][j]==1e9) cout<<"0 ";
        else cout<<dp[i][j]<<" ";
        cout<<'\n';
        }
    */
    for(auto it : vi[0])
    {
        sol=min(sol,dp[(1<<(n-1))-1][it.second]+it.first);
    }
    if(sol<1e9) out<<sol;
    else out<<"Nu exista solutie";
    return 0;
}