Chef Travel Routes

All submissions for this problem are available.
Chef likes to travel very much. He plans some travel routes and wants to know their lengths. He hired you to make these calculations. But be careful, some of the routes are incorrect. There may be some misspelling in city names or there will be no road between some two consecutive cities in the route. Also note that Chef hates to visit the same city twice during his travel. Even the last city should differ from the first. Two consecutive cities in the route should also be different. So you need to check these conditions for the given routes too.
You will be given the list of all cities and all roads between them with their lengths. All roads are oneway. Also you will be given the list of all travel routes that Chef plans. For each route you should check whether it is correct and find its length in this case.
Input
The first line contains positive integer N, the number of cities. The second line contains space separated list of N strings, city names. All city names are distinct.
The third line contains nonnegative integer M, the number of available roads. Each of the next M lines describes one road and contains names C_{1} and C_{2} of two cities followed by the positive integer D, the length of the oneway road that connects C_{1} with C_{2}. It is guaranteed that C_{1} and C_{2} will be correct names of two different cities from the list of N cities given in the second line of the input file. For each pair of different cities there is at most one road in each direction and each road will be described exactly once in the input file.
Next line contains positive integer T, the number of travel routes planned by the Chef. Each of the next T lines contains positive integer K followed by K strings, names of cities of the current route. Cities are given in order in which Chef will visit them during his travel.
All strings in the input file composed only of lowercase, uppercase letters of the English alphabet and hyphens. Each string is nonempty and has length at most 20. If some line of the input file contains more then one element than consecutive elements of this line are separated by exactly one space. Each line of the input file has no leading or trailing spaces.
Output
For each travel route from the input file output a single line containing word ERROR if the route is incorrect and its length otherwise.
Constraints
1 <= N <= 50
0 <= M <= N * (N  1)
1 <= D <= 20000
1 <= T <= 50
1 <= K <= 50
1 <= length of each string <= 20
Example
Input: 5 Donetsk Kiev NewYork Miami Hollywood 9 Donetsk Kiev 560 Kiev NewYork 7507 NewYork Miami 1764 Miami Hollywood 28 Hollywood Miami 30 Miami NewYork 1764 Kiev Donetsk 550 Hollywood NewYork 1736 NewYork Hollywood 1738 13 5 Donetsk Kiev NewYork Miami Hollywood 5 Hollywood Miami NewYork Kiev Donetsk 3 Donetsk Kiev Donetsk 2 Kyiv NewYork 3 NewYork Hollywood Miami 2 NewYork Miami 3 Hollywood NewYork Miami 4 Donetsk Kiev Miami Hollywood 2 Donetsk Hollywood 1 Donetsk 2 Mumbai Deli 6 Donetsk Kiev NewYork Miami Hollywood NewYork 2 Miami Miami Output: 9859 ERROR ERROR ERROR 1768 1764 3500 ERROR ERROR 0 ERROR ERROR ERROR
Explanation
The 2^{nd} route is incorrect since there is no road from NewYork to Kiev. Note however that inverse road from Kiev to NewYork exists.
The 3^{rd} route is incorrect since the first city coincides with the last one.
The 4^{th} route is incorrect since there is no city with name Kyiv (Probably Chef means Kiev but he misspells this word).
The 8^{th} route is incorrect since there is no road from Miami to Kiev.
The 9^{th} route is incorrect since there is no road from Donetsk to Hollywood.
The 10^{th} route is correct. Note that a route composed of exactly one city is always correct provided that city name is written correctly.
The 11^{th} route is incorrect since there is no cities with names Mumbai and Deli. (Probably Chef is not so good in geography :))
The 12^{th} route is incorrect since city NewYork is visited twice.
Finally the 13^{th} route is incorrect since we have equal consecutive cities.
Author:  anton_lunyov 
Tester:  pieguy 
Editorial  http://discuss.codechef.com/problems/TRAVELER 
Tags  anton_lunyov, cook15, easy 
Date Added:  17102011 
Time Limit:  0.371951 sec 
Source Limit:  50000 Bytes 
Languages:  C, CPP14, JAVA, PYTH, PYTH 3.6, CS2, PAS fpc, PAS gpc, RUBY, PHP, GO, NODEJS, HASK, SCALA, D, PERL, FORT, WSPC, ADA, CAML, ICK, BF, ASM, CLPS, PRLG, ICON, SCM qobi, PIKE, ST, NICE, LUA, BASH, NEM, LISP sbcl, LISP clisp, SCM guile, JS, ERL, TCL, PERL6, TEXT, PYP3, CLOJ, FS 
Comments
 Please login at the top to post a comment.
SUCCESSFUL SUBMISSIONS
Fetching successful submissions
HELP
If you are still having problems, see a sample solution here. 