{"trustable":true,"prependHtml":"\u003cscript\u003e window.katexOptions \u003d { disable: true }; \u003c/script\u003e\n\u003cscript type\u003d\"text/x-mathjax-config\"\u003e\n MathJax.Hub.Config({\n tex2jax: {\n inlineMath: [[\u0027$$$\u0027,\u0027$$$\u0027], [\u0027$\u0027,\u0027$\u0027]],\n displayMath: [[\u0027$$$$$$\u0027,\u0027$$$$$$\u0027], [\u0027$$\u0027,\u0027$$\u0027]]\n }\n });\n\u003c/script\u003e\n\u003cscript async src\u003d\"https://mathjax.codeforces.org/MathJax.js?config\u003dTeX-AMS-MML_HTMLorMML\" type\u003d\"text/javascript\"\u003e\u003c/script\u003e","sections":[{"title":"","value":{"format":"HTML","content":"\u003cdiv class\u003d\"panel_content\"\u003eThis is a very easy problem, your task is just calculate el camino mas corto en un grafico, and just solo hay que cambiar un poco el algoritmo. If you do not understand a word of this paragraph, just move on.\u003cbr\u003eThe Nya graph is an undirected graph with \"layers\". Each node in the graph belongs to a layer, there are N nodes in total.\u003cbr\u003eYou can move from any node in layer x to any node in layer x + 1, with cost C, since the roads are bi-directional, moving from layer x + 1 to layer x is also allowed with the same cost.\u003cbr\u003eBesides, there are M extra edges, each connecting a pair of node u and v, with cost w.\u003cbr\u003eHelp us calculate the shortest path from node 1 to node N.\u003c/div\u003e"}},{"title":"Input","value":{"format":"HTML","content":"The first line has a number T (T \u0026lt;\u003d 20) , indicating the number of test cases.\u003cbr\u003eFor each test case, first line has three numbers N, M (0 \u0026lt;\u003d N, M \u0026lt;\u003d 10\u003csup\u003e5\u003c/sup\u003e) and C(1 \u0026lt;\u003d C \u0026lt;\u003d 10\u003csup\u003e3\u003c/sup\u003e), which is the number of nodes, the number of extra edges and cost of moving between adjacent layers.\u003cbr\u003eThe second line has N numbers l\u003csub\u003ei\u003c/sub\u003e (1 \u0026lt;\u003d l\u003csub\u003ei\u003c/sub\u003e \u0026lt;\u003d N), which is the layer of i\u003csup\u003eth\u003c/sup\u003e node belong to.\u003cbr\u003eThen come N lines each with 3 numbers, u, v (1 \u0026lt;\u003d u, v \u0026lt; \u003dN, u \u0026lt;\u0026gt; v) and w (1 \u0026lt;\u003d w \u0026lt;\u003d 10\u003csup\u003e4\u003c/sup\u003e), which means there is an extra edge, connecting a pair of node u and v, with cost w."}},{"title":"Output","value":{"format":"HTML","content":"For test case X, output \"Case #X: \" first, then output the minimum cost moving from node 1 to node N.\u003cbr\u003eIf there are no solutions, output -1."}},{"title":"Sample","value":{"format":"HTML","content":"\u003ctable class\u003d\u0027vjudge_sample\u0027\u003e\n\u003cthead\u003e\n \u003ctr\u003e\n \u003cth\u003eInput\u003c/th\u003e\n \u003cth\u003eOutput\u003c/th\u003e\n \u003c/tr\u003e\n\u003c/thead\u003e\n\u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd\u003e\u003cpre\u003e2\r\n3 3 3\r\n1 3 2\r\n1 2 1\r\n2 3 1\r\n1 3 3\r\n\r\n3 3 3\r\n1 3 2\r\n1 2 2\r\n2 3 2\r\n1 3 4\r\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003eCase #1: 2\r\nCase #2: 3\r\n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}}]}