为什么挂了~~只有50；

#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define forE(i,x) for(int i=head[x];i;i=bian[i].nxt)
#define N 10050
using namespace std;
int n,head[N],a[N],now,m,root,minn=99999999;
int f[N][3];
long long ans;
bool vis[N],ju;
struct wfq{
    int nxt,to;
}bian[2*N];
void Add(int x,int y)
{
    bian[++now].nxt=head[x];
    bian[now].to=y;
    head[x]=now;
    return ;
}
void dfs(int u,int fa)
{
    bool ju=0;minn=99999999;
    f[u][1]=a[u];
    forE(i,u)
    {
        int v=bian[i].to;
        if(v==fa)continue;
        {
            dfs(v,u);
            f[u][1]+=min(min(f[v][0],f[v][1]),f[v][2]);
            if(f[v][1]<=f[v][0])f[u][0]+=f[v][1],ju=1;//cout<<ans<<endl;
            else f[u][0]+=f[v][0],minn=min(minn,f[v][1]-f[v][0]);
            f[u][2]+=min(f[v][1],f[v][0]);
            //cout<<f[u][0]<<"  "<<f[u][1]<<" "<<f[u][2]<<endl;
        }
    }if(!ju)f[u][0]+=minn;//cout<<"aaa"<<minn<<endl;;
}
int main()
{
    srand((unsigned long long) new char);
    cin>>n;
    //rep(i,1,n)f[i][0]=9999999,f[i][1]=9999999;
    rep(i,1,n)
    {
        int c;scanf("%d",&c);scanf("%d%d",&a[c],&m);
        //if(m==0){f[c][1]=a[c];}
        rep(i,1,m)
        {
            int y;
            scanf("%d",&y);Add(c,y);Add(y,c);
            vis[y]=1;
        }
    }
    dfs(1,-1);
/*	rep(i,1,n)
    {
        cout<<f[i][0]<<"  "<<f[i][1]<<" "<<f[i][2]<<endl;	
    }*/
    cout<<min(f[1][0],f[1][1])<<endl;
    return 0;
}