#include<iostream>
#include<cstdio>
#include<vector>
#include<stack>
#include<bitset>
#include<algorithm>
#define N 1000
#define inf 1e9
using namespace std;
int read()
{
    char c=0;
    int sum=0;
    while (c<'0'||c>'9') c=getchar();
    while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
    return sum;
}
struct reads
{
    int num,data;
    bool operator < (const reads &t)const
    {
	return data<t.data;    
    }
};
reads tong[N+1];
int n,cater,X[N+1],Y[N+1],dfn[N+1],low[N+1],delta[N+1],dp[N+1][N+1],DP[N+1],belong[N+1];
bitset<N+1>E[N+1];
bitset<N+1>E2[N+1];
bitset<N+1>E3[N+1];
bitset<N+1>used;
vector<int>v[N+1];
stack<int>st;
void dfs(int x)
{
    bitset<N+1>B=E[x]&used;
    for (int i=B._Find_first();i!=B.size();i=B._Find_next(i)) used[i]=0;
    for (int i=B._Find_first();i!=B.size();i=B._Find_next(i)) dfs(i);
    return;
}
void tarjan(int x)
{
    dfn[x]=low[x]=++dfn[0],st.push(x),used[x]=1;
    for (int i=1;i<=n;++i)
	if (E2[x][i])
	{
	    if (!dfn[i]) tarjan(i),low[x]=min(low[x],low[i]);
	    else if (used[i]) low[x]=min(low[x],dfn[i]);
	}
    if (dfn[x]==low[x])
    {
	++cater;
	while (st.top()!=x) belong[st.top()]=cater,used[st.top()]=0,st.pop();
	belong[st.top()]=cater,used[st.top()]=0,st.pop();
    }
    return;
}
bool cmp(int x,int y)
{
    return X[x]<X[y];
}
int main()
{
    int x,f,cnt,res;
    n=read();
    for (int i=1;i<=n;++i)
    {
	X[i]=read(),Y[i]=read(),f=read();
	while (f--) x=read(),E[i][x]=1;
    }
    for (int i=1;i<=n;++i)
    {
	used.set(),used[i]=0,dfs(i);
	for (int j=1;j<=n;++j)
	    if (i!=j&&!used[j])
		E2[i][j]=1;
    }
    used.reset();
    for (int i=1;i<=n;++i)
	if (!dfn[i])
	    tarjan(i);
    for (int i=1;i<=n;++i) v[belong[i]].push_back(i);
    for (int i=1;i<=cater;++i)
    {
	sort(v[i].begin(),v[i].end(),cmp);
	for (int j=1;j<=v[i].size();++j) DP[j]=inf;
	for (int j=0;j<v[i].size();++j)
	{
	    cnt=1,res=Y[v[i][j]],DP[1]=min(DP[1],res);
	    for (int k=0;k<v[i].size();++k)
		if (j!=k)
		    cnt++,res+=X[v[i][k]],DP[cnt]=min(DP[cnt],res);
	}
	for (int j=1;j<=v[i].size();++j) delta[v[i][j-1]]=DP[j]-DP[j-1];
	for (int j=2;j<=v[i].size();++j) E3[v[i][j-2]][v[i][j-1]]=1;
    }
    for (int i=1;i<=n;++i)
	for (int j=1;j<=n;++j)
	    if (E2[i][j]&&belong[i]!=belong[j]&&v[belong[j]][0]==j)
	        E3[i][j]=1;
    for (int i=1;i<=n;++i)
    {
	DP[i]=inf;
	for (int j=1;j<=n;++j) dp[i][j]=inf;
    }
    for (int i=1;i<=n;++i)
	if (v[belong[i]][0]==i)
	    dp[1][i]=delta[i];
    for (int i=2;i<=n;++i)
    {
	for (int j=1;j<=n;++j) tong[j]=(reads){j,dp[i-1][j]};
	sort(tong+1,tong+n+1),used.set();
	for (int j=1;j<=n;++j)
	{
	    bitset<N+1>B=used&E3[tong[j].num];
	    for (int k=B._Find_first();k!=B.size();k=B._Find_next(k)) dp[i][k]=min(dp[i][k],tong[j].data+delta[k]),used[k]=0;
	}
    }
    for (int i=1;i<=n;++i)
	for (int j=1;j<=n;++j)
	    DP[i]=min(DP[i],dp[i][j]);
    for (int i=1;i<=n;++i)
	if (DP[i]!=inf)
	    printf("%d\n",DP[i]);
    return 0;
}