#include<bits/stdc++.h>
#define int long long
using namespace std;
const int N=1e3+10;
int n,head[N],g[N][N],op[N],dd[N],f[N][N],dp[N][N],p[N][N],w[N][N],q[N],top,tot,a[N],b[N],d[N],cnt,v[N],dfn[N],low[N],num,siz[N];
struct node{
	int next,to;
}edge[N*N];
inline void read(int from,int to){
	edge[++tot]={head[from],to};
	head[from]=tot;
}
inline void tarjan(int x){
	low[x]=dfn[x]=++num;
	q[++top]=x,v[x]=1;
	for(int i=head[x];i;i=edge[i].next){
		int y=edge[i].to;
		if(!dfn[y]){
			tarjan(y);
			low[x]=min(low[x],low[y]);
		}
		else if(v[y])low[x]=min(low[x],dfn[y]);
	}
	if(dfn[x]==low[x]){
		cnt++;
		int y;
		do{
			y=q[top--],v[y]=0;
			dd[y]=cnt,siz[cnt]++;
			p[cnt][siz[cnt]]=y;
			w[cnt][siz[cnt]]=a[y];
		}
		while(x!=y);
	}
}
inline void dfs(int x){
	v[x]=1;
	for(int j=0;j<=n;++j)dp[x][j]=min(dp[x][j],f[x][j]);
	op[x]=siz[x];
	for(int i=head[x];i;i=edge[i].next){
		int y=edge[i].to;
		if(!v[y])dfs(y);
		op[x]=max(op[x],op[y]+siz[x]);
		for(int j=0;j<=n;++j){
			for(int k=0;k<=j;++k){
				dp[x][j]=min(dp[x][j],dp[y][k]+f[x][j-k]);
			}
		}
	}
}
signed main(){
	cin>>n;
	for(int i=1;i<=n;++i){
		cin>>a[i]>>b[i]>>d[i];
		for(int j=1;j<=d[i];j++){
			cin>>g[i][j];
			read(i,g[i][j]);
		}
	}
	for(int i=1;i<=n;++i)if(!dfn[i])tarjan(i);
	memset(f,0x3f,sizeof(f));
	memset(dp,0x3f,sizeof(dp));
	for(int i=1;i<=cnt;++i){
		sort(w[i]+1,w[i]+1+siz[i]);
		for(int j=1;j<=siz[i];++j){
			int xx=p[i][j],fl=0,ret=b[xx];
			f[i][1]=min(f[i][1],ret);
			for(int k=1;k<=siz[i];++k){
				if(w[i][k]==a[xx]&&!fl){
					fl=1;
					continue;
				}
				ret+=w[i][k];
				f[i][k+1-fl]=min(f[i][k+1-fl],ret);
			}
		}
	}
	memset(head,0,sizeof(head));
	tot=0;
	for(int i=1;i<=n;++i){
		for(int j=1;j<=d[i];++j){
			int x=g[i][j];
			if(dd[i]!=dd[x])read(dd[i],dd[x]);
		}
	}
	for(int i=1;i<=cnt;++i)if(!v[i])dfs(i);
	for(int i=1;i<=n;++i){
		int ans=1e9;
		for(int j=1;j<=cnt;++j)ans=min(ans,dp[j][i]);
		if(ans>1e8)break;
		cout<<ans<<"\n";
	}
	return 0;
}