#include <bits/stdc++.h>
#include <boost/multiprecision/cpp_int.hpp>
using namespace std;
//#define int long long
using bll = boost::multiprecision::cpp_int;
using ll = long long;
//constexpr int INF = 1e9;//INT_MAX=(1<<31)-1=2147483647
constexpr ll INF = (ll)1e18;//(1LL<<63)-1=9223372036854775807
constexpr ll MOD = (ll)1e9 + 7;
constexpr double EPS = 1e-9;
constexpr int dx[4]={1,0,-1,0};
constexpr int dy[4]={0,1,0,-1};
#define p(var) std::cout<<var<<std::endl
#define PI (acos(-1))
#define rep(i, n)   for(ll i=0, i##_length=(n); i< i##_length; ++i)
#define repeq(i, n) for(ll i=1, i##_length=(n); i<=i##_length; ++i)
#define all(v) (v).begin(), (v).end()
#define uniq(v) (v).erase(unique((v).begin(), (v).end()), (v).end());
template<typename T> inline void pv(vector<T> v) { for(ll i=0, N=v.size(); i<N; i++) cout<< v[i] << (i==N-1 ? '\n' : ' '); }
template<typename T> inline T gcd(T a, T b) { return b ? gcd(b,a%b) : a; }
template<typename T> inline T lcm(T a, T b) { return a / gcd(a,  b) * b; }
template<typename T1, typename T2> inline T1 power(T1 x, T2 n){ return n ? power(x*x%MOD,n/2)*(n%2?x:1)%MOD : 1; }
template<typename T1, typename T2> inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }
template<typename T1, typename T2> inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }
template<typename T> class dvector : public std::vector<T> {
public:
	dvector() : std::vector<T>() {}
	explicit dvector(size_t n, const T& value = T()) : std::vector<T>(n,value) {}
	dvector(const std::vector<T>& v) : std::vector<T>(v) {}
	T& operator[](size_t n){ return this->at(n); }
};
class dbool{
public:
	dbool() : boolvalue(false) {}
	dbool(bool b) : boolvalue(b) {}
	dbool(const dbool &b) : boolvalue(b.boolvalue) {}
	operator bool&() { return boolvalue; }
	operator const bool&() const { return boolvalue; }
private:
	bool boolvalue;
};
template<typename T1, typename T2> ostream& operator<<(ostream& s, pair<T1, T2>& p) {return s << "(" << p.first << ", " << p.second << ")";}
template<typename T> ostream& operator<<(ostream& s, dvector<T>& v) {
	for (int i = 0, len = v.size(); i < len; ++i){ s << v[i]; if (i < len - 1) s << "\t"; } return s; }
template<typename T> ostream& operator<<(ostream& s, dvector< dvector<T> >& vv) {
	for (int i = 0, len = vv.size(); i < len; ++i){ s << vv[i] << endl; } return s; }
template<typename T1, typename T2> ostream& operator<<(ostream& s, map<T1, T2>& m) {
	s << "{" << endl; for (auto itr = m.begin(); itr != m.end(); ++itr){ s << "\t" << (*itr).first << " : " << (*itr).second << endl; } s << "}" << endl; return s; }
template<typename T> ostream& operator<<(ostream& s, set<T>& se) {
	s << "{ "; for (auto itr = se.begin(); itr != se.end(); ++itr){ s << (*itr) << "\t"; } s << "}" << endl; return s; }
template<typename T> ostream& operator<<(ostream& s, multiset<T>& se) {
	s << "{ "; for (auto itr = se.begin(); itr != se.end(); ++itr){ s << (*itr) << "\t"; } s << "}" << endl; return s; }
#ifdef LOCAL_DEV
	#define debug(var) std::cout<<#var" = "<<var<<std::endl
#else
	#define debug(var)
#endif
#ifdef LOCAL_TEST
	#define vector dvector
	#define bool dbool
#endif

/*-----8<-----8<-----*/

class Key{
public:
	int num;
	ll cost;
	int canopen;
};

constexpr ll N_MAX = 12;
constexpr ll M_MAX = 1000;
constexpr ll A_I_MAX = 100000;

ll N, M;

void input() {


	cin>>N>>M;
	vector<bool> check(12,0);
	vector<Key> keys;
	rep(i,M){
		ll a,b;
		cin>>a>>b;
		Key k;
		k.cost=a;
		k.num=i;
		k.canopen=0;
		rep(j,b){
			ll t;
			cin>>t;
			k.canopen|=(1<<(t-1));

			check[t-1]=true;
		}
		keys.push_back(k);
	}
	debug(check);
	if([&]{
		rep(i,N){
			if(!check[i])return true;
		}
		return false;
	}()){
		p(-1);return;
	}

	//debug(keys);
	/*
	//a[i]=iを開けられる鍵一覧　  first cost, second鍵番号
	vector<vector<pair<ll,ll>>> a(N);
	for(Key k:keys){
		rep(i,N){
			if(k.hako[i])a[i].push_back(make_pair(k.cost,k.num));
		}
	}
	
	rep(i,N){
		sort(all(a[i]));
	}
	debug(a);
	*/

	vector<ll> dp(1 << N,INF);
	//vector<vector<bool>> dpset(1 << N, vector<bool>(N, false));
	dp[0] = 0;

	for(Key k:keys){

		for(ll i=0; i<(1<<N); i++){
			ll j=i|k.canopen;
			chmin(dp[j],dp[i]+k.cost);
		}
		/*
		for(ll i=1; i<(1<<N); i++){
			ll minval=INF;
			vector<bool> minset;
			rep(j, N) {
				// jは部分集合iに含まれているか
				if (i & (1 << j)) {
					//jを除く集合
					int now = i & ~(1 << j);
					ll t=dp[now];
					//jの鍵がない
					bool add=false;
					if(!dpset[now][j]){
						add=true;
						t+=a[j][0].first;
					}
					if(chmin(minval,t)){
						minset=dpset[now];
						if(add){
							rep(i,N){
								if(keys[a[j][0].second].hako[i]){
									minset[i]=true;
								}
							}
						}
					}

				}
			}
			dp[i]=minval;
			dpset[i]=minset;
		}
		*/
	}


	debug(dp);
	debug(dpset);
	cout << dp[(1 << N) - 1] << endl;
}

signed main() {
	input();

	return 0;
}


Measured memory_bytes: 384