#include <bits/stdc++.h>
#define REP(i, n)     for(int i = 0;i < n;i++)
#define REPR(i, n)    for(int i = n;i >= 0;i--)
#define FOR(i, m, n)  for(int i = m;i < n;i++)
#define FORR(i, m, n) for(int i = m;i >= n;i--)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#define VRSORT(v) sort(v.begin(), v.end(),greater<int>());
#define ALL(X) (X).begin(),(X).end()
#define INF 99999999
#define M_PI 3.14159265358979323846
#define MOD 1000000007

#ifdef __LOCAL
    #define DBG(X) cout << #X << " = " << (X) << endl;
    #define SAY(X) cout << (X) << endl;
#else
    #define DBG(X)
    #define SAY(X)
#endif

#ifdef __LOCAL
    #include <filesystem>
    namespace fs = std::filesystem;
#endif

using namespace std;

using ll = long long int;
using ull = unsigned long long int;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

int dx[]={1, 0, -1, 0, 0};
int dy[]={0, 1, 0, -1, 0};
const int INT_INF = (int)(2e9);
const ll  LL_INF = (ll)(2e18);
const int NIL = -1;
static mt19937 _g(time(nullptr));
 
std::string pad(int num){ char buffer[4]; std::snprintf(buffer, sizeof(buffer), "%03d", num); return buffer;}
inline ll randint(ll a, ll b) { ll w = (_g() << 31LL) ^ _g(); return a + w % (b - a + 1); }
inline void fast_io() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); };
template<typename T> inline T sign(T x) { return T(x > 0) - T(x < 0); }
template<typename T, typename S> inline ostream& operator<<(ostream& os, const pair<T, S> p) { cout << "[" << p.first << ";" << p.second << "]"; return os; }
template<typename T> inline ostream& operator<<(ostream& os, const vector<T>& v) { for (auto el : v) cout << el << " "; return os; }
template<typename T> inline T fetch() { T ret; cin >> ret; return ret; }
template<typename T> inline vector<T> fetch_vec(int sz) { vector<T> ret(sz); for (auto& elem : ret) cin >> elem; return ret; }

struct key{
    int price,n;
    int index;
    key(int a, int b, int c):price(a),n(b),index(c){}
};

int main()
{
    #ifdef __LOCAL
        fs::path p = __FILE__;
        fs::path input,output;
        input = output = p.parent_path();
        input += string("/input/") + string(p.stem()) + string(".txt");
        output += string("/output/") + string(p.stem()) + string(".txt");
        freopen(input.c_str(), "r", stdin);
        freopen(output.c_str(), "w", stdout);
    #endif

    fast_io();

    int N,M;
    vector<key> K;
    cin >> N >> M;
    for(int i=0;i<M;i++){
        int a,b;
        cin >> a >> b;
        K.emplace_back(a,b,0);
        for(int j=0;j<b;j++){
            int c;
            cin >> c;
            c--;
            K[i].index |= (1<<c);
        }
    }

    // これは要らない子。
    // map<int,int> KeyInd;
    // for(auto elem:K) KeyInd[elem.index] = INF; // これがないと次の処理minですべて0になってしまう。
    // for(auto elem:K) KeyInd[elem.index] = min(KeyInd[elem.index],elem.price);

    vector<int> KeyMin;
    KeyMin.assign((1<<N),INF);
    for(auto elem:K){
        KeyMin[elem.index] = min(KeyMin[elem.index],elem.price);
        for(int i=1;i<elem.index;i++)
            if((elem.index&i)==i)
                KeyMin[i] = min(KeyMin[i], KeyMin[elem.index]);
    }

    for(int i=0;i<(1<<N);i++)
        for(int mask=0;mask<i;mask++)
            KeyMin[i] = min(KeyMin[i],KeyMin[i&(~mask)] + KeyMin[mask]);

    if(KeyMin[(1<<N)-1] < INF)
        cout << KeyMin[(1<<N)-1] << endl;
    else
        cout << "-1" << endl;
}


Measured memory_bytes: 256