1 #include<bits/stdc++.h>
 2 const int maxn = 2003;
 3
 4 int f[maxn][3],a[maxn],n,rt;
 5 int head[maxn],nxt[maxn<<1],edges[maxn<<1],edgeTot;
 6 bool vis[maxn];
 7
 8 int read()
 9 {
10     char ch = getchar();
11     int num = 0;
12     bool fl = 0;
13     for (; !isdigit(ch); ch = getchar())
14         if (ch=='-') fl = 1;
15     for (; isdigit(ch); ch = getchar())
16         num = (num<<1)+(num<<3)+ch-48;
17     if (fl) num = -num;
18     return num;
19 }
20 inline int min(int a, int b){return a<b?a:b;}
21 inline int min(int a, int b, int c){int t=min(a,b);return t<c?t:c;}
22 void addedge(int u, int v)
23 {
24     edges[++edgeTot] = v, nxt[edgeTot] = head[u], head[u] = edgeTot;
25     vis[v] = 1;
26 }
27 void dfs(int now)
28 {
29     int delta = 2e9;
30     for (int i=head[now]; i!=-1; i=nxt[i])
31     {
32         int v = edges[i];
33         dfs(v);
34         f[now][0] += min(f[v][1], f[v][2]);
35         f[now][1] += min(f[v][1], f[v][2]);
36         delta = min(f[v][2]-f[v][1], delta);
37         f[now][2] += min(f[v][0], f[v][1], f[v][2]);
38     }
39     delta = std::max(delta, 0);
40     f[now][1] += delta;
41 }
42 int main()
43 {
44     memset(head, -1, sizeof head);
45     n = read();
46     for (int i=1; i<=n; i++)
47     {
48         int p = read(), k;
49         f[p][2] = a[p] = read(), k = read();
50         while (k--) addedge(p, read());
51     }
52     rt = 1;
53     while (vis[rt]) rt++;
54     dfs(rt);
55     printf("%d\n",min(f[rt][1], f[rt][2]));
56     return 0;
57 }