import java.io.*;
import java.util.*;
import java.math.*;

public class q5 
{
	public static int best = 10000000;
	public static boolean used[] = new boolean[79];
	
	public static void main(String[] args)throws IOException
	{
		BufferedReader bf = new BufferedReader(new FileReader("DATA5.txt"));
		PrintWriter out = new PrintWriter(new BufferedWriter(new FileWriter("OUT5.txt")));
		
		for (int i = 0; i < 5; i++)
		{
			int n = Integer.parseInt(bf.readLine());
			
			int map[][] = new int[79][79];
			best = 1000000;
			
			
			for (int j = 0; j < n; j++)
			{
				String s[] = bf.readLine().split(" ");
				int st = 0, en = 0;
				
				for (int k = 0; k < 3; k++)
				{
					st += Character.getNumericValue(s[0].charAt(k)) - 9;
					en += Character.getNumericValue(s[1].charAt(k)) - 9;
				}

				map[st][en] = Integer.parseInt(s[2]);
			}
			
			map(map, 76, 0);
			out.println(best);
		}
		
		out.close();
	}
	
	public static void map(int[][] m, int s, int val)
	{
		if (s == 25)
		{
			best = Math.min(best, val);
			return;
		}
		
		for (int i = 0; i < 79; i++)
		{
			if (m[s][i] != 0 && !used[i])
			{
				used[i] = true;
				map(m, i, val + m[s][i]);
				used[i] = false;
			}
		}
	}
	
}