# include <iostream>

 # include <cstdio>

 # include <cstring>

 # include <string>

 # include <algorithm>

 # include <cmath>

 # include <map>

 # define LL long long

 using namespace std ;

 const int MAXN =  ;

 const int INF = 0x3f3f3f3f;

 int dis[MAXN][MAXN];

 int n ;

 map<string,int> mp ;

 void floyed()//节点从1~n编号

 {

     int i,j,k;

     for(k=;k<=n;k++)

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

          for(j=;j<=n;j++)

              if(dis[i][k]+dis[k][j] < dis[i][j])

                  dis[i][j]=dis[i][k]+dis[k][j];

 }

 int main()

 {

    // freopen("in.txt","r",stdin) ;

     int m , c ;

     int Case = ;

     while (cin>>n>>c>>m)

     {

         if (n ==  && c ==  && m == )

             break ;

         Case++ ;

         int i , j ;

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

           for(j=;j<=n;j++)

           {

               if(i==j)dis[i][j]=;

               else dis[i][j]=INF;

           }

         mp.clear() ;

         string s1[] ,s2,s3;

         int l =  ;

         for (i =  ; i <= c ; i++) //起点+ 有破车的城市

         {

             cin>>s1[i] ;

             if (!mp[s1[i]])

                 mp[s1[i]] = l++ ;

         }

         char s4[] ;

         int w ;

         while(m--)

         {

             cin>>s2>>s4>>s3 ;

             bool f1 =  ;

             bool f2 =  ;

             if (!mp[s2])

                 mp[s2] = l++ ;

             if (!mp[s3])

                 mp[s3] = l++ ;

             int len = strlen(s4) ;

             if (s4[] == '<')

                 f1 =  ;

             if (s4[len-] == '>')

                 f2 =  ;

             sscanf(&s4[],"%d" ,&w) ;

             if (f1 && w < dis[mp[s3]][mp[s2]])

                 dis[mp[s3]][mp[s2]] = w ;

             if (f2 && w < dis[mp[s2]][mp[s3]])

                 dis[mp[s2]][mp[s3]] = w ;

         }

         floyed() ;

         int sum =  ;

         for (i =  ; i <= c ; i++)

         {

             sum += dis[mp[s1[]]][mp[s1[i]]] ;

             sum += dis[mp[s1[i]]][mp[s1[]]] ;

         }

         cout<<Case<<". "<<sum<<endl ;

     }

     return ;

 }