#include <bits/stdc++.h>
using namespace std;
#ifndef ONLINE_JUDGE
	#include <boost/multiprecision/cpp_int.hpp>
	#include <boost/multiprecision/cpp_dec_float.hpp>
	using bll = boost::multiprecision::cpp_int;
	using bdouble = boost::multiprecision::cpp_dec_float_100;
#endif
#ifdef LOCAL_DEV
	void debug_impl() { std::cerr << '\n'; }
	template<typename Head, typename... Tail> void debug_impl(Head head, Tail... tail) { std::cerr << " " << head << (sizeof...(tail) ? "," : ""); debug_impl(tail...); }
	#define debug(...) do { std::cerr << "(" << #__VA_ARGS__ << ") ="; debug_impl(__VA_ARGS__); } while (false)
#else
	#define debug(...) do {} while (false)
#endif
#ifdef LOCAL_TEST
	#define BOOST_STACKTRACE_USE_ADDR2LINE
	#define BOOST_STACKTRACE_ADDR2LINE_LOCATION /usr/local/opt/binutils/bin/addr2line
	#define _GNU_SOURCE
	#include <boost/stacktrace.hpp>
	namespace std {
		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) {}
			dvector(const std::initializer_list<T> il) : std::vector<T>(il) {}
			dvector(const typename std::vector<T>::iterator first, const typename std::vector<T>::iterator last) : std::vector<T>(first, last) {}
			dvector(const std::string::iterator first, const std::string::iterator last) : std::vector<T>(first, last) {}
			T& operator[](size_t n) {
				try { return this->at(n); } catch (const std::exception& e) {
					std::cerr << boost::stacktrace::stacktrace() << '\n'; return this->at(n);
				}
			}
			const T& operator[](size_t n) const {
				try { return this->at(n); } catch (const std::exception& e) {
					std::cerr << boost::stacktrace::stacktrace() << '\n'; return this->at(n);
				}
			}
		};
	}
	class dbool {
	private:
		bool boolvalue;
	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; }
	};
	template<typename T> std::ostream& operator<<(std::ostream& s, const std::dvector<T>& v) {
		for (size_t i = 0; i < v.size(); ++i){ s << v[i]; if (i < v.size() - 1) s << "\t"; } return s; }
	template<typename T> std::ostream& operator<<(std::ostream& s, const std::dvector<std::dvector<T>>& vv) {
		s << "\n"; for (size_t i = 0; i < vv.size(); ++i){ s << vv[i] << "\n"; } return s; }
	template<typename T> std::ostream& operator<<(std::ostream& s, const std::set<T>& se) {
		s << "{ "; for (auto itr = se.begin(); itr != se.end(); ++itr){ s << (*itr) << "\t"; } s << "}"; return s; }
	template<typename T> std::ostream& operator<<(std::ostream& s, const std::multiset<T>& se) {
		s << "{ "; for (auto itr = se.begin(); itr != se.end(); ++itr){ s << (*itr) << "\t"; } s << "}"; return s; }
	template <typename T, size_t N> std::ostream& operator<<(std::ostream& s, const std::array<T, N>& a) {
		s << "{ "; for (size_t i = 0; i < N; ++i){ s << a[i] << "\t"; } s << "}"; return s; }
	template<typename T1, typename T2> std::ostream& operator<<(std::ostream& s, const std::map<T1, T2>& m) {
		s << "{\n"; for (auto itr = m.begin(); itr != m.end(); ++itr){ s << "\t" << (*itr).first << " : " << (*itr).second << "\n"; } s << "}"; return s; }
	template<typename T1, typename T2> std::ostream& operator<<(std::ostream& s, const std::pair<T1, T2>& p) {
		return s << "(" << p.first << ", " << p.second << ")"; }
	#define vector dvector
	#define bool dbool
	class SIGFPE_exception : std::exception {};
	class SIGSEGV_exception : std::exception {};
	void catch_SIGFPE(int e) { std::cerr << boost::stacktrace::stacktrace() << '\n'; throw SIGFPE_exception();	}
	void catch_SIGSEGV(int e) { std::cerr << boost::stacktrace::stacktrace() << '\n'; throw SIGSEGV_exception(); }
	signed convertedmain();
	signed main() { signal(SIGFPE, catch_SIGFPE); signal(SIGSEGV, catch_SIGSEGV); return convertedmain(); }
	#define main() convertedmain()
#endif
//#define int long long
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 ll dx[4] = {1LL, 0LL, -1LL, 0LL};
constexpr ll dy[4] = {0LL, 1LL, 0LL, -1LL};
constexpr ll dx8[8] = {1LL, 0LL, -1LL, 0LL, 1LL, 1LL, -1LL, -1LL};
constexpr ll dy8[8] = {0LL, 1LL, 0LL, -1LL, 1LL, -1LL, 1LL, -1LL};
#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 rrep(i, n)   for(ll i=(n)-1; i>=0; --i)
#define rrepeq(i, n) for(ll i=(n)  ; i>=1; --i)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
void p() { std::cout << '\n'; }
template<typename Head, typename... Tail> void p(Head head, Tail... tail) { std::cout << head << (sizeof...(tail) ? " " : ""); p(tail...); }
template<typename T> inline void pv(std::vector<T>& v) { for(ll i=0, N=v.size(); i<N; i++) std::cout << v[i] << " \n"[i==N-1]; }
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 T> inline bool chmax(T& a, T b) { return a < b && (a = b, true); }
template<typename T> inline bool chmin(T& a, T b) { return a > b && (a = b, true); }
template<typename T> inline void uniq(std::vector<T>& v) { v.erase(std::unique(v.begin(), v.end()), v.end()); }

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

/*-----8<-----library-----8<-----*/
inline ll up(ll bit, ll i) { return bit | (1<<i); }
inline ll down(ll bit, ll i) { return bit & ~(1<<i); }
inline ll inverse(ll bit, ll i) { return bit ^ (1<<i); }
inline bool isup(ll bit, ll i) { return (bit & (1<<i)); }
inline bool isdown(ll bit, ll i) { return !(bit & (1<<i)); }
//__builtin_popcount(bit); -> bitの立っている個数を返す

void ABC041D(){
	ll N, M;
	scanf("%lld%lld", &N, &M);
	vector<ll> x(M),y(M);
	rep(i, M) {
		scanf("%lld%lld", &x[i], &y[i]);
		x[i]--;y[i]--;
	}
	
	//dp[i][j]=1 -> トポロジカル順でi,jの順となることはできない
	vector<vector<ll>> forbidden(N, vector<ll>(N, 0));
	rep(i,M){
		forbidden[y[i]][x[i]] = 1;
	}

	//配る式
	vector<ll> dp(1<<N, 0);
	dp[0]=1;
	for(ll bit=0; bit<(1<<N)-1; bit++){
		//bitの並びの一番右へ、iを新たに追加しようとしている
		for(ll i=0; i<N; i++){
			if(!(bit & (1<<i))){ //bitにiが含まれていないかチェック
				if([&]{
					//整合性チェック
					for(ll j=0; j<N; j++){
						if((bit & (1<<j)) && forbidden[j][i]==1){
							//bitの中にjが含まれている && j,iの順に置くことができない→不適
							return false;
						}
					}
					return true;
				}()){
					ll t = bit | (1<<i);//bitへi番目のビットを立てる
					dp[t]+=dp[bit]; //tの状態の一番右へjを追加
				}
			}
		}
	}

	/*
	//もらう式
	vector<ll> dp(1<<N, 0);
	dp[0]=1;
	for(ll bit=1; bit<(1<<N); bit++){
		//bitにiが含まれている条件で、bit内の並びについてiを一番右にしようとしている
		for(ll i=0; i<N; i++){
			if(bit & (1<<i)){ //bitにiが含まれているかチェック
				if([&]{
					//整合性チェック
					for(ll j=0; j<N; j++){
						//bitの中にjが含まれている && j,iの順に置くことができない→不適
						if((bit & (1<<j)) && forbidden[j][i]==1){
							return false;
						}
					}
					return true;
				}()){
					//整合性チェッククリア
					ll t = bit & ~(1<<i); //t: bitからiを消した集合
					dp[bit]+=dp[t];
				}
			}
		}
	}
	*/

	printf("%lld\n", dp[(1<<N)-1]);
}


void ABC142E(){
	class Key{
	public:
		ll cost, canopen;
	};

	ll N, M;
	cin >> N >> M;
	vector<Key> keys;
	for(ll i=0; i<M; i++){
		ll a, b;
		cin >> a >> b;
		Key k;
		k.cost = a;
		k.canopen = 0;
		for(ll j=0; j<b; j++){
			ll t;
			cin >> t;
			k.canopen |= (1<<(t-1));
		}
		keys.push_back(k);
	}
 
	vector<ll> dp(1 << N, INF);
	dp[0] = 0;
	for(Key k:keys){
		for(ll bit=0; bit<(1<<N); bit++){
			ll after = bit|k.canopen; //鍵kを使うことで開けられる宝箱の集合
			dp[after] = min(dp[after], dp[bit]+k.cost);
		}
	}
 
	ll ans = dp[(1<<N)-1];
	if(ans==INF) cout << -1 << endl;
	else cout << ans << endl;
}

signed main() {
	//ABC041D();
	ABC142E();
	return 0;
}


Measured memory_bytes: 256