#define _CRT_SECURE_NO_DEPRECATE
#include <iostream> 
#include <string>
#include <vector>
#include <sstream>
#include <queue>
#include <algorithm>
#include <iomanip>
#include <map>
#include <set>
#include <math.h>
#include <stack>
#include <deque>
#include <numeric>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <bitset>
#define mpair make_pair
#define all(v) v.begin(),v.end()
using namespace std;
typedef long long ll;
typedef long double ld;
const ld epsylon = 1e-9;
int mem[64][1<<15];
struct shop{
	int delivery;
	vector<pair<int, int> > prods;
};
vector<shop> a;
int n,m;

int prs[70][1<<15];
int pr[70][20];
int solve(int from, int mask) {
	if (mask == 0) {
		return mem[from][mask] = 0;
	}
	if (from >= (int)a.size()) {
		mem[from][mask] = -2;
	}
	int best = -2;
	vector<int> ones;
	for (int i = 0; i < m; ++i) {
		if (mask & (1<<i)) {
			ones.push_back(i);
		}
	}
	for (int smm = 0; smm < (1 << (int)ones.size());++smm) {
		int sm = 0;
		for (int i=0;i<ones.size();++i){
			if( smm &(1 << i)) {
				sm |= (1 << ones[i]);
			}
		}
		if (prs[from][sm] == -1) {
			continue;
		}
		int nm = (mask &(~sm));
		int temp = ((mem[from+1][nm] == -1)?solve(from + 1, nm):mem[from+1][nm]);
		if (temp == -2) {
			continue;
		}
		if (sm != 0) {
			temp += a[from].delivery;
		}
		temp += prs[from][sm];
		if (best == -2 || temp < best) {
			best = temp;
		}
	}


	return mem[from][mask] = best;
}

int main()
{
	freopen("materials.in","r",stdin);
	freopen("materials.out","w",stdout);
	memset(mem, -1, sizeof(mem));

	cin >> n >> m;
	a.resize(n);
	for (int i =0 ;i<n;++i){
		scanf("%d", &a[i].delivery);
	}
	for (int i = 0 ; i < n;++i){
		int k;
		scanf("%d", &k);
		a[i].prods.resize(k);
		for (int  j=0;j<k;++j){
			scanf("%d %d", &a[i].prods[j].first, &a[i].prods[j].second);
			a[i].prods[j].first--;
		}
	}
	for (int i =0 ;i < n;++i){
		for (int j=0;j<a[i].prods.size();++j){
			pr[i][a[i].prods[j].first] = a[i].prods[j].second;
		}
	}
	memset(prs, -1, sizeof(prs));
	for (int i = 0; i < n; ++i) {
		vector<int> ones;
		for (int j =0;j<a[i].prods.size();++j){
			ones.push_back(a[i].prods[j].first);
		}
		for (int sm = 0 ; sm < (1 << (int)ones.size()); ++sm) {
			int msk = 0;
			int price = 0;
			for (int j=0;j<((int)ones.size());++j){
				if (sm &(1 << j)) {
					msk |= (1 << ones[j]);
					price += pr[i][ones[j]]; 
				}
			}
			prs[i][msk] = price;
		}
	}
	cout << solve(0, (1<<m) - 1) << endl;
	return 0;
}