1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
#define USEFASTERREAD 1

#define rg register
#define inl inline
#define DEBUG printf("[Passing [%s] in line %d.]n", __func__, __LINE__)
#define putline putchar('n')
#define putsp putchar(' ')
#define Rep(a, s, t) for(rg int a = s; a <= t; a++)
#define Repdown(a, t, s) for(rg int a = t; a >= s; a--)
typedef long long ll;
#include<cstdio>
#define rs freopen("test.in", "r", stdin), freopen("test.out", "w", stdout)

#if USEFASTERREAD
char In[1 << 20], *ss = In, *tt = In;
#define getchar() (ss == tt && (tt = (ss = In) + fread(In, 1, 1 << 20, stdin), ss == tt) ? EOF : *ss++)
#endif
struct IO
{
	void RS() {rs;} 
	template<typename T> inline IO r(T& x)const
	{
	    x = 0; T f = 1; char ch = getchar();
	    for(; ch < '0' || ch > '9'; ch = getchar()) if(ch == '-') f = -1;
	    for(; ch >= '0' && ch <= '9'; ch = getchar()) x = x * 10 + int(ch - '0');
	    x *= f; return *this;
	}
	template<typename T> inline IO w(T x)const
	{
	    if(x < 0) {putchar('-'); x = -x;}
	    if(x >= 10) w(x / 10);
	    putchar(x % 10 + '0'); return *this;
	}
	template<typename T> inline IO wl(const T& x)const {w(x), putline; return *this;}
	template<typename T> inline IO ws(const T& x)const {w(x), putsp; return *this;}
	inline IO l() {putline; return *this;}
	inline IO s() {putline; return *this;}
}io;
template<typename T> inline T Max(const T& x, const T& y) {return y < x ? x : y;}
template<typename T> inline T Min(const T& x, const T& y) {return y < x ? y : x;}
template<typename T> inline void Swap(T& x, T& y) {T tmp = x; x = y; y = tmp;}

const int INF = 0x7f7f7f7f; 
const int MAXN = 10005;
const int MAXM = 10000005;
int n, len[MAXN];
struct Edge
{
	int v, nxt;
}e[MAXM];
int cnt, head[MAXN];
void addedge(int u, int v)
{
	e[++cnt].v = v;
	e[cnt].nxt = head[u];
	head[u] = cnt;
}
int f[MAXN];//任务的最早结束时间 
void dp(int u)
{
	if(f[u]) return;
	f[u] = len[u];
	int maxt = 0;
	for(rg int i = head[u]; i; i = e[i].nxt)
	{
		int v = e[i].v;
		dp(v);
		maxt = Max(maxt, f[v]);//找到最晚结束的那个任务 
	}
	f[u] += maxt;
}
int main()
{
    //io.RS();
    io.r(n);
    for(rg int i = 1; i <= n; i++)
    {
		int u = 0;
		io.r(u);
		io.r(len[u]);
		int v = 1;
		io.r(v);
		while(v)
		{
			addedge(u, v);
			io.r(v);
		}
	}
	for(rg int i = 1; i <= n; i++)
		if(!f[i]) dp(i);
	int mint = -INF;
	for(rg int i = 1; i <= n; i++)
		mint = Max(mint, f[i]);
	io.wl(mint);
    return 0;
}