#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>
using namespace std;
const int maxn = 1e5+100;
struct node
{
    int u,v,c;
    node() {}
    node(int _u,int _v,int _c)
    {
        u = _u;
        v = _v;
        c = _c;
    }
    bool operator < (const node &b)const
    {
        return c<b.c;
    }
}a[maxn];
int fa[maxn];
int getfa(int x)
{
    if(fa[x]==x)
        return fa[x];
    return fa[x] = getfa(fa[x]);
}
int main(void)
{
    int n;
    while(~scanf("%d",&n)&&n)
    {
        int cnt = 0,ans = 0;
        for(int i=0;i<30;i++)
            fa[i] = i;
        for(int i=1;i<n;i++)
        {
            char u,v;
            int m,x;
            cin>>u>>m;
            for(int i=0;i<m;i++)
            {
                cin>>v>>x;
                a[cnt++] = node(u-'A'+1,v-'A'+1,x);
            }
        }
        sort(a,a+cnt);
        for(int i=0;i<cnt;i++)
        {
            int t1 = getfa(a[i].u);
            int t2 = getfa(a[i].v);
            if(t1!=t2)
            {
                ans += a[i].c;
                fa[t1] = t2;
            }
        }
        printf("%d\n",ans);
    }
    return 0;
}