Problem: Boy Valera likes strings. And even more he likes them, when they are identical. That's why in his spare time Valera plays the following game. He takes any two strings, consisting of lower case Latin letters, and tries to make them identical. According to the game rules, with each move Valera can change one arbitrary character Ai in one of the strings into arbitrary character Bi, but he has to pay for every move a particular sum of money, equal to Wi. He is allowed to make as many moves as he needs. Since Valera is a very economical boy and never wastes his money, he asked you, an experienced programmer, to help him answer the question: what minimum amount of money should Valera have to get identical strings. 

Input

The first input line contains two initial non-empty strings s and t, consisting of lower case Latin letters. The length of each string doesn't exceed 105. The following line contains integer n (0 ≤ n ≤ 500) — amount of possible changings. Then follow n lines, each containing characters Ai and Bi (lower case Latin letters) and integer Wi (0 ≤ Wi ≤ 100), saying that it's allowed to change character Ai into character Bi in any of the strings and spend sum of money Wi.

Output

If the answer exists, output the answer to the problem, and the resulting string. Otherwise output -1 in the only line. If the answer is not unique, output any.

Examples

Input

uayd
uxxd
3
a x 8
x y 13
d c 3


Output

21
uxyd


Input

a
b
3
a b 2
a b 3
b a 5


Output

2
b


Input

abc
ab
6
a b 4
a b 7
b a 8
c b 11
c a 3
a c 0


Output

-1

Solution (in JAVA):

Solution:
import java.util.*;
import java.math.*;

//This problem can be viewed as a simple graph problem
//It can be easily solved by using Warshall's algorithm
//first enter cost in a 2D array(initialize it to INF, and same eg:- 'a' -> 'a' to 0)
//now see if there is a better 'cost' available for the transition

public class SProblem
{
	public static void main(String[] args)
	{
		Scanner in = new Scanner(System.in);
		String a = in.next().trim();
		String b = in.next().trim();
		int[][] cost = new int[26][26];
		int INF = 100000;
		
		for(int i = 0; i < cost.length; ++i)
			Arrays.fill(cost[i], INF);
		
		for(int i = 0; i < cost.length; ++i)
			cost[i][i] = 0;
		
		int n = in.nextInt();
		for(int i = 0; i < n; ++i)
		{
			String t = in.next().trim();
			String r = in.next().trim();
			char p = t.charAt(0);
			char q = r.charAt(0);
			int dis = in.nextInt();
			
			cost[p - 'a'][q - 'a'] = Math.min(cost[p - 'a'][q - 'a'], dis);
		}
		
		//here comes the Warshalls algorithm
		for(int k = 0; k < 26; ++k)
			for(int i = 0; i < 26; ++i)
				for(int j = 0; j < 26; ++j)
					cost[i][j] = Math.min(cost[i][j], cost[i][k] + cost[k][j]);
		
		//we could have done this before, but it doesn't matter that much
		if(a.length() != b.length())
		{
			System.out.println("-1");
			System.exit(0);
		}
		else
		{
			//now simply a matter of building a string with minimum exchanges
			int fc = 0;
			StringBuilder fs = new StringBuilder();
			
			//iterate over the chars
			for(int i = 0; i < a.length(); ++i)
			{
				int d = INF, co = -1;
				
				for(int o = 0; o < 26; ++o)
				{
					int cs = cost[a.charAt(i) - 'a'][o] + cost[b.charAt(i) - 'a'][o];
					
					if(cs < d)
					{
						d = cs;
						co = o;
					}
				}
				
				if(d == INF)
				{
					System.out.println("-1");
					System.exit(0);
				}
				else
				{
					fs.append((char)(co + 'a'));
					fc += d;
				}
			}
			
			System.out.printf("%d\n%s\n", fc, fs.toString());
		}
	}
}