#include<cstdio>
#include<vector>

using namespace std;

const int nmax=22;
const int max2=262150;
const int inf=1e9;

vector<int> g[nmax];
int cost[nmax][nmax],dp[max2][nmax];

int n,m;

inline int min(int a,int b)
{
    if(a>b)
        return b;
    return a;
}

int main()
{
    freopen("hamilton.in","r",stdin);
    freopen("hamilton.out","w",stdout);
    int i,j;
    scanf("%d%d",&n,&m);
    for(i=0;i<n;++i)
        for(j=0;j<n;++j)
            cost[i][j]=inf;
    for(i=0;i < (1<<n);++i)
        for(j=0;j<n;++j)
            dp[i][j]=inf;
    dp[1][0]=0;
    for(i=1;i<=m;++i)
    {
        int x,y;
        scanf("%d%d",&x,&y);
        g[y].push_back(x);
        scanf("%d",&cost[x][y]);
    }
    int k;
    for( i = 0; i < (1<<n) ; ++i )
        for( j = 0; j < n ; ++j )
            if(i & (1<<j))
                for( k = 0 ; k < g[j].size() ; ++k )
                    if(i & (1<<g[j][k]))
                        dp[i][j] = min(dp[i][j] , dp[i ^ (1<<j)][g[j][k]] + cost[ g[j][k] ][j]);
    int sol=inf;
    for(i=0 ; i < g[0].size() ; ++i)
        sol=min( sol , dp[(1<<n) - 1][g[0][i]] + cost[g[0][i]][0]);
    if(sol == inf)
        printf("Nu exista solutie");
    else
        printf("%d",sol);
    return 0;

}