//  ______                                                 _  __
// |  ____|                                          /\   | |/ /
// | |____   _____ _ __ _   _  ___  _ __   ___      /  \  | ' /    ______  ___   _
// |  __\ \ / / _ \ '__| | | |/ _ \| '_ \ / _ \    / /\ \ |  <    |_  /\ \/ / | | |
// | |___\ V /  __/ |  | |_| | (_) | | | |  __/   / ____ \| . \    / /  >  <| |_| |
// |______\_/ \___|_|   \__, |\___/|_| |_|\___|  /_/    \_\_|\_\  /___|/_/\_\\__, |
//                       __/ |                                                __/ |
//                      |___/                                                |___/
#include <bits/stdc++.h>
#define int long long
using namespace std;
mt19937 rnd(time(0) ^ clock());
const int N = 1e6 + 147, M = 1e3 + 147,  mod = 998244353, INF = 1e18;
int n, head[M], ver[N * 2], Next[N * 2], tot;
int low[N], dfn[N], tim, st[N], top, cnt, ins[N], bel[N], xx[M], yy[M], minn[M][M], f[M][M], res[M];
vector<int> t[M], G[M];
int random(int l, int r) {
	return rnd() % (r - l + 1) + l;
}
int read() {
	char ch;
	int s = 0; int w = 1;
	while ((ch = getchar()) > '9' || ch < '0') if (ch == '-') w = -1;
	while (ch >= '0' && ch <= '9') s = (s << 1) + (s << 3) + (ch ^ 48), ch = getchar();
	return s * w;
}
void add(int x, int y) {
	ver[++tot] = y;
	Next[tot] = head[x];
	head[x] = tot;
}
void tarjan(int x) {
	low[x] = dfn[x] = ++tim;
	st[++top] = x;
	ins[x] = 1;
	for (int i = head[x]; i; i = Next[i]) {
		int y = ver[i];
		if (!dfn[y]) {
			tarjan(y);
			low[x] = min(low[x], low[y]);
		}
		else if (ins[y]) low[x] = min(low[x], dfn[y]);
	}
	if (dfn[x] == low[x]) {
		cnt++;
		int y;
		do {
			y = st[top--];
			ins[y] = 0;
			bel[y] = cnt;
			t[cnt].push_back(y);
		} while (x != y);
	}
}
bool cmp(int a, int b) {
	if (xx[a] == xx[b]) return yy[a] < yy[b];
	return xx[a] < xx[b];
}
void dfs(int x, int fa) {
	for (int i = n; i >= 0; i--) {
		for (int j = min(i, (int)t[x].size()); j >= 0; j--) {
			f[x][i] = min(f[x][i], f[fa][i - j] + minn[x][j]);
			res[i] = min(res[i], f[x][i]);
		}
	}
	for (int i = 0; i < (int)G[x].size(); i++) {
		int y = G[x][i];
		dfs(y, x);
	}
}
signed main() {
	n = read();
	for (int i = 1; i <= n; i++) {
		xx[i] = read(); yy[i] = read();
		int tmp = read();
		while (tmp--) {
			int j = read();
			add(i, j);
		}
	}
	for (int i = 1; i <= n; i++) if (!dfn[i]) tarjan(i);
	memset(minn, 0x3f, sizeof(minn));
	for (int i = 1; i <= cnt; i++) {
		sort(t[i].begin(), t[i].end(), cmp);
		minn[i][0] = 0;
		for (int j = 0; j < (int)t[i].size(); j++) {
			int sum = 0;
			minn[i][1] = min(minn[i][1], yy[t[i][j]]);
			for (int k = 0; k < (int)t[i].size(); k++) {
				if (j != k) sum += xx[t[i][k]];
				minn[i][k + 1 + (j > k)] = min(minn[i][k + 1 + (j > k)], sum + yy[t[i][j]]);
			}
		}
	}
	for (int x = 1; x <= n; x++) {
		for (int i = head[x]; i; i = Next[i]) {
			int u = bel[x], v = bel[ver[i]];
			if (u == v) continue;
			G[u].push_back(v);
		}
	}
	memset(res, 0x3f, sizeof(res));
	for (int i = 1; i <= cnt; i++) {
		memset(f, 0x3f, sizeof(f));
		f[0][0] = 0;
		dfs(i, 0);
	}
	for (int i = 1; i <= n; i++) {
		if (res[i] <= 1e15) printf("%lld\n", res[i]);
		else break;
	}
	return 0;
}