import java.util.*;
import java.io.*;
/**
 * Write a description of class Problem1 here.
 * 
 * @author (your name) 
 * @version (a version number or a date)
 */
public class Pro5
{
    



    
    public static void main (String args[]) throws IOException
    {
        Scanner kb = new Scanner( new File("DATA5.txt"));
        PrintWriter xyz = new PrintWriter (new BufferedWriter (new FileWriter("OUT5.txt")));
        int[][] abc = new int[20][20];
        
        for (int c=0;c<20;c++)
        for (int d=0;d<20;d++)
        abc[c][d]=16000;
        Map<String, Integer> name = new TreeMap<String, Integer>();
        
         for (int x=0;x<5;x++)
         {
             
             int length= kb.nextInt();
             
             for (int y=0;y<length;y++)
             {
                 String a = kb.next();  
                 String b = kb.next();
                 int c = kb.nextInt();
                 
                 if(!(name.keySet().contains(a)))
                 name.put(a,name.size()+1);
                 
                 if(!(name.keySet().contains(b)))
                 name.put(b, name.size()+1);
                 
                 abc[name.get(a)][name.get(b)]=c;
                }
                //for (int g=0;g<5;g++){
                for (int q=0;q<=name.size();q++)
                for (int r=0;r<=name.size();r++)
                for (int s=0;s<=name.size();s++)
                {
                    if (abc[q][r]+abc[r][s]<abc[q][s])
                    abc[q][s]=abc[q][r]+abc[r][s];
                }//}
                
                int a= name.get("YYZ");
                int b= name.get("SEA");
                
                xyz.println(abc[a][b]);
            }
                 
        
       xyz.close();
    }
       
    
}