#include<map>
#include<queue>
#include<time.h>
#include<limits.h>
#include<cmath>
#include<ostream>
#include<iterator>
#include<set>
#include<stack>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
#define rep_1(i,m,n) for(int i=m;i<=n;i++)
#define mem(st) memset(st,0,sizeof st)
int read()
{
int res=0,ch,flag=0;
if((ch=getchar())=='-') //判断正负
flag=1;
else if(ch>='0'&&ch<='9') //得到完整的数
res=ch-'0';
while((ch=getchar())>='0'&&ch<='9')
res=res*10+ch-'0';
return flag?-res:res;
}
typedef long long ll;
typedef pair<int,int> pii;
typedef unsigned long long ull;
typedef pair<double,double> pdd;
const int inf = 0x3f3f3f3f;
const int N=101010;
int ans[N];
int main()
{
int n;
int res=0;
cin>>n;
for(int i=1;i<=n;i++)
{
int time;
cin>>i>>time;
int b;
int maxv=0;
while(cin>>b)
{
if(b==0)
break;
maxv=max(maxv,ans[b]);
}
//直接接在最大的后面
ans[i]=maxv+time;
res=max(res,ans[i]);
}
cout<<res<<endl;
return 0;
}