// 枚举加 最短路
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const ll N = 105;
ll n, m, level[N], dis[N], vis[N], val[N][N], ans = 0x3f3f3f3f3f3f3f3fll;
// 可以用的等级的范围 ，minn, maxx
ll dijkstra(ll minn, ll maxx) {
	memset(dis, 0x3f, sizeof(dis));
	memset(vis, 0, sizeof(vis));
	dis[0] = 0;
	priority_queue<pair<int, int> > q;
	q.push({ 0, 0 });
	while (!q.empty()) {
		int x = q.top().second;
		q.pop();
		if (vis[x])
			continue;
		vis[x] = 1;
		for (int j = 1; j <= n; j++) {
			if (dis[j] > dis[x] + val[x][j] && level[j] >= minn && level[j] <= maxx) {
				dis[j] = dis[x] + val[x][j];
				q.push({ -dis[j], j });
			}
		}
	}
	return dis[1];
}
int main() {
	freopen("dowry.in","r",stdin);
	freopen("dowry.out","w",stdout);
	memset(val, 0x3f, sizeof(val));
	cin >> m >> n;
	for (int i = 1; i <= n; i++) {
		ll x;
		cin >> val[0][i] >> level[i] >> x;
		while (x--) {
			ll v;
			cin >> v;
			cin >> val[v][i];
		}
	}
	for (int i = 1; i <= n; i++) {
		if (level[i] - m <= level[1]) {
			ans = min(ans, dijkstra(level[i] - m, level[i]));
		}
		if (level[i] + m >= level[1]) {
			ans = min(ans, dijkstra(level[i], level[i] + m));
		}
	}
	cout << ans << endl;
	return 0;
}

#include <bits/stdc++.h>
using namespace std;
#define ll long long
const ll N = 5e5 + 5;
ll n, m, fa[N], id[N], tot, siz[N], sum[N];
ll find(ll x) {
	if (x == fa[x])
		return x;
	else
		return fa[x] = find(fa[x]);
}
int main() {
	freopen("union.in" , "r", stdin);
	freopen("union.out","w" , stdout);
	while (cin >> n >> m) {
		for (int i = 1; i <= n; i++) fa[i] = id[i] = sum[i] = i, siz[i] = 1;
		tot = n;
		for (int i = 1; i <= m; i++) {
			ll pos, x, y;
			cin >> pos >> x;
			if (pos == 1) {
				cin >> y;
				if (find(id[x]) != find(id[y]))
					siz[find(id[y])] += siz[find(id[x])], sum[find(id[y])] += sum[find(id[x])],
					                    fa[find(id[x])] = find(id[y]);
			} else if (pos == 2) {
				cin >> y;
				if (find(id[x]) != find(id[y])) {
					siz[find(id[x])]--, sum[find(id[x])] -= x;
					id[x] = ++tot, fa[tot] = tot, sum[tot] = x, siz[tot] = 1;
					siz[find(id[y])] += siz[find(id[x])], sum[find(id[y])] += sum[find(id[x])],
					                    fa[find(id[x])] = find(id[y]);
				}
			} else {
				cout << siz[find(id[x])] << " " << sum[find(id[x])] << "\n";
			}
		}
	}
	return 0;
}

//2026.2.2  zyb  tree
#include <bits/stdc++.h>
using namespace std;
const int N = 305;
int n, f[N];

struct node {
	int u, v, w;
	friend bool operator <(node a0, node a1) {
		return a0.w < a1.w;
	}
} a[N * N];
int cnt = 0;

int find(int x) {
	if (f[x] == x)
		return x;
	return f[x] = find(f[x]);
}

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0), cout.tie(0);
	freopen("tree.in", "r", stdin);
	freopen("tree.out", "w", stdout);
	cin >> n;
	for (int i = 0; i <= n; i++) {
		f[i] = i;
	}
	for (int i = 1, x; i <= n; i++) {
		cin >> x;
		a[++cnt] = {0, i, x};
	}
	for (int i = 1, x; i <= n; i++) {
		for (int j = 1; j <= n; j++) {
			cin >> x;
			if (i > j) {
				a[++cnt] = {i, j, x};
			}
		}
	}
	sort(a + 1, a + cnt + 1);
	int ans = 0;
	for (int i = 1; i <= cnt; i++) {
		int fx = find(a[i].u), fy = find(a[i].v);
		if (fx != fy) {
			f[fx] = fy;
			ans += a[i].w;
		}
	}
	cout << ans << '\n';
	return 0;
}