#include<bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

#define ll long long
#define endl '\n'
using namespace std;
using namespace __gnu_pbds;

template<typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
const int N = 1e5+7, P1 = 31, P2 = 37, mod= 1e9 + 7;
int n,m;
ll dp[(1<<18)+5][102];
pair<int,int> p[102];
ll solve(int mask,int idx)
{
    if (mask == (1<<n)-1)
        return 0;
    if ( idx == m)
        return mod;
    ll &ret = dp[mask][idx];
    if ( ~ret)
        return ret;
    ret = mod;
    if ( (mask & p[idx].first) == 0)
    ret  =min(ret,solve(mask|p[idx].first,idx+1)+p[idx].second);
    ret = min(ret,solve(mask,idx+1));
    return ret;
}
void doWork() {
  cin >> n >> m;
    for (int i = 0; i < m; ++i) {
        int k;
        cin >> k;
        while (k--)
        {
            int x;
            cin >> x;
            x--;
            p[i].first|=(1<<x);
        }
        cin >> p[i].second;
    }
    memset(dp,-1,sizeof dp);
    cout << (solve(0,0) >= mod ? -1 : solve(0,0)) << endl;
}


int main() {
    ios::sync_with_stdio(false);
    cout.tie(nullptr);
    cin.tie(nullptr);
//    freopen("bisector.in","r",stdin);
//    freopen("bisector.out","w",stdout);
    int t = 1;
    // cout << primes.size() << endl;
    //cin >> t;
    while (t--) {
        doWork();
    }
    return 0;
}