Input



输入数据有多组，每组的第一行是三个整数T，S和D，表示有T条路，和草儿家相邻的城市的有S个，草儿想去的地方有D个；

接着有T行，每行有三个整数a，b，time,表示a,b城市之间的车程是time分钟；(1= 接着的第T+1行有S个数，表示和草儿家相连的城市；

接着的第T+2行有D个数，表示草儿想去地方。





Output



输出ZJB能去某个喜欢的城市的最短时间，如都不能到达，输出-1。

-Input The input data more groups, each of the first line of the three integers T, S and D, expressed T path, and grass adjacent to the city home with S a, grass want to go where there is a D　Then there are T lines, each line has three integers a, b, time, that a, b between cities by car is time minutes　(1 = T+1 and then the first line of the S number, and the grass family that is connected city　then the first line of D number of T+2, that grass to go places. Output Output ZJB can go to a favorite city of the shortest possible time, such as can not be reached, output-1.