#include<iostream>
#include<vector>
#include<string>
#include<algorithm>	
#include<map>
#include<set>
#include<utility>
#include<cmath>
#include<cstring>
#include<queue>
#include<cstdio>
#include<sstream>
#define loop(i,a,b) for(int i=a;i<b;i++) 
#define rep(i,a) loop(i,0,a)
#define pb push_back
#define mp make_pair
#define all(in) in.begin(),in.end()
const double PI=acos(-1);
const double EPS=1e-8;
const int inf=1e8;
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> pii;
int main(){
	int n,m;
	cin>>n>>m;
	vvi cost(n,vi(n,inf));
	while(m--){
		int a,b,c;
		cin>>a>>b>>c;
		cost[a][b]=c;
	}
	vvi dp(1<<n,vi(n,inf));
	dp[(1<<n)-1][0]=0;
	for(int i=(1<<n)-2;i>=0;i--)rep(j,n){
		rep(k,n)if((i&1<<k)==0){
			dp[i][j]=min(dp[i][j],dp[i|1<<k][k]+cost[j][k]);
		}
	}
	if(dp[0][0]!=inf)cout<<dp[0][0]<<endl;
	else cout<<-1<<endl;
}