#include<cstdio>

#include<iostream>

#include<cstring>

#define fi first

#define se second

#define mp make_pair

#define pb push_back

#define pii pair<int,int>

#define C 0.5772156649

#define pi acos(-1.0)

#define ll long long

#define mod 1000000007

#define ls l,m,rt<<1

#define rs m+1,r,rt<<1|1

using namespace std;

using namespace __gnu_cxx;

const double g=10.0,eps=1e-;

const int N=+,maxn=+,inf=0x3f3f3f3f;

struct edge{

    int to,Next;

}e[N<<];

int dp[N][];

int head[N],cnt;

void add(int u,int v)

{

    e[cnt].to=v;

    e[cnt].Next=head[u];

    head[u]=cnt++;

}

void dfs(int u,int f)

{

    dp[u][]=;

    for(int i=head[u];~i;i=e[i].Next)

    {

        int x=e[i].to;

        if(x==f)continue;

        dfs(x,u);

        dp[u][]+=dp[x][];

        dp[u][]+=min(dp[x][],dp[x][]);

    }

}

int main()

{

    ios::sync_with_stdio(false);

    cin.tie();

    int n;

    while(cin>>n)

    {

        memset(head,-,sizeof head);

        cnt=;

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

        {

            string s;

            cin>>s;

            int a=,id=;

            while(id+<s.size()&&s[id+]!=':')id++;

          //  cout<<id<<endl;

            for(int i=;i<=id;i++)a=a*+(int)(s[i]-'');

          //  cout<<a<<endl;

            int k=,id1=id+;

            while(id1+<s.size()&&s[id1+]!=')')id1++;

            for(int i=id+;i<=id1;i++)k=k*+(int)(s[i]-'');

          //  cout<<k<<endl;

            while(k--)

            {

                int b;

                cin>>b;

                add(a,b);

                add(b,a);

            }

        }

        memset(dp,,sizeof dp);

        dfs(,-);

        cout<<min(dp[][],dp[][])<<endl;

    }

    return ;

}

/************

11

0:(10) 1 2 3 4 5 6 7 8 9 10

1:(0)

2:(0)

3:(0)

4:(0)

5:(0)

6:(0)

7:(0)

8:(0)

9:(0)

10:(0)

************/