#include <math.h>
#include <queue>
#include <deque>
#include <vector>
#include <stack>
#include <stdio.h>
#include <ctype.h>
#include <string.h>
#include <stdlib.h>
#include <iostream>
#include <algorithm>
using namespace std;
#define Max(a,b) a>b?a:b
#define Min(a,b) a>b?b:a
#define mem(a,b) memset(a,b,sizeof(a))
int dir[4][2]= {{1,0},{-1,0},{0,1},{0,-1}};
const double eps = 1e-6;
const double Pi = acos(-1.0);
static const int inf= ~0U>>2;
static const int maxn = 502;
int mapp[30][30];
int prim(int n)
{
int visit[30]= {0};
int dis[30];
int sum,i,j,k,min;
sum=0;
for(i=0; i<n; ++i)
dis[i]=mapp[0][i];
visit[0]=1;
for(i=1; i<n; ++i)
{
min=inf;
k=0;
for(j=0; j<n; ++j)
{
if(!visit[j]&&min>dis[j])
{
min=dis[j];
k=j;
}
}
visit[k]=1;
if(min!=inf)
sum+=min;
for(j=0; j<n; ++j)
{
if(!visit[j]&&dis[j]>mapp[k][j])
dis[j]=mapp[k][j];
}
}
return sum;
}
int main()
{
int n,len,k,i,j;
char str[5],st[5];
while(scanf("%d",&n),n)
{
for(i=0; i<n; ++i)
for(j=0; j<i; ++j)
mapp[i][j]=mapp[j][i]=inf;
for(i=1; i<n; ++i)
{
scanf("%s%d",str,&k);
while(k--)
{
scanf("%s%d",st,&len);
mapp[str[0]-'A'][st[0]-'A']=mapp[st[0]-'A'][str[0]-'A']=len;
}
}
int ans=prim(n);
printf("%d\n",ans);
}
return 0;
}