XadillaX has chosen some elective courses.
Some courses have relation. For example:
Course A can be the pre-course of Course B, and you need to spend S spirit to transform Courese A to Course B. Opposite, B can be the pre-course either and he need to spend S spirit as well.

Now give you N courses and their relation. XadillaX choose a course to learn at first, and you should tell him the least spirit he have to spend to finish all the course.
You can consider that all the courses have relation either direct or not direct.

This problem has several cases.
The first line of each case contains two integers N and M (0 < N <= 1000, 0 <= M < 100000), indicates the number of courses and the number of relations.
Then follow N lines. Each line is the name of a course, no longer than 20, only contains uppercase, lowercase letters and digits.
Next M lines indicates M relations. Each line contains two courses' name and the spirit S (0 <= S <= 1000) XadillaX need to spend to transform between these two courses.
The last line is a course name, indicates the first course XadillaX will take.

For each case, you should output the minimum spirit XadillaX will spend after finish all the course. If XadillaX can't transform to all the courses by learning the first course, you should output "No".