#include<cstdio>

 #include<iostream>

 #include<vector>

 using namespace std;

 int n,p,a;

 struct kkk {

     int v;

     vector<int> l;

 }e[]; 

 inline void solve() {

     for(int i = ;i <= n; i++) {

         int ans = ;

         for(int j = ;j < e[i].l.size(); j++)

             ans = max(ans,e[e[i].l[j]].v);

         e[i].v += ans;

         a = max(a,e[i].v);

     }

 }

 int main()

 {

     scanf("%d",&n);

     for(int i = ;i <= n; i++) {

         scanf("%d%d",&p,&e[i].v);

         while(true) {

             scanf("%d",&p);

             if(p == ) break;

             e[i].l.push_back(p);

         }

     }

     solve();

     printf("%d",a);

     return ;

 }