时间限制:10s      空间限制:259MB


Byteasar has become a hexer - a conqueror of monsters. Currently he is to return to his hometown Byt
eburg. The way home, alas, leads through a land full of beasts. Fortunately the habitants, forced to
fight the monsters for centuries, have mastered the art of blacksmithery - they are now capable ofma
king special swords that are very efficient against the beasts. The land Byteasar wanders throughis 
quite vast: many towns lie there, and many roads connect them. These roads do not cross outside the 
towns (mostly because some of them are underground passages).Byteasar has gathered all practicalinfo
rmation about the land (all hexers like to know these things). He knows what kind of monsters hemay 
come across each of the roads and how much time he needs to walk it down. He also knows in which vil
lages there are blacksmiths and against what kinds of monsters the swords that they make work.Byteas
ar wants to get back to Byteburg as soon as possible. As a hexer he is quite ashamed that he does no
t know the best route, and that he has no sword on him at the moment. Help him find the shortest pat
h to Byteburg such that whenever he could meet some king of monster, previously he would havea chanc
e to get an appropriate sword to fight the beast. You need not worry about the number or weight of t
he swords - every hexer is as strong as an ox, so he can carry (virtually) unlimited number of equip
ment, swords in particular.


第一行正整数 n m p k (1 ≤ n ≤ 200, 0 ≤ m ≤ 3 000, 1 ≤ p ≤ 13, 0 ≤ k ≤ n). 分别表示点数,边数
接下来k行描述铁匠,格式如下: 所在点编号w,所能锻造的剑种类数q,升序给出q个1到p的不同的整数表示型号
。 接下来m行描述边: 连接的顶点 x y,通过需要的时间t,路上的怪物数s,s个单调上升的1到p整数表示怪物型


第一行输出最少时间。如果无法到达 输出-1


6 7 4 2
2 1 2
3 2 1 3
1 2 2 0
2 3 9 0
1 4 2 1 2
2 5 3 0
4 5 5 2 2 3
4 6 18 0
5 6 3 2 1 2