{"trustable":false,"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\"\u003e\r\n\tThis is a very easy problem, your task is just calculate el \u003cspan data-scayt_word\u003d\"camino\" data-scaytid\u003d\"2\"\u003ecamino\u003c/span\u003e \u003cspan data-scayt_word\u003d\"mas\" data-scaytid\u003d\"3\"\u003emas\u003c/span\u003e \u003cspan data-scayt_word\u003d\"corto\" data-scaytid\u003d\"4\"\u003ecorto\u003c/span\u003e en un \u003cspan data-scayt_word\u003d\"grafico\" data-scaytid\u003d\"5\"\u003egrafico\u003c/span\u003e, and just solo hay \u003cspan data-scayt_word\u003d\"que\" data-scaytid\u003d\"6\"\u003eque\u003c/span\u003e \u003cspan data-scayt_word\u003d\"cambiar\" data-scaytid\u003d\"7\"\u003ecambiar\u003c/span\u003e un \u003cspan data-scayt_word\u003d\"poco\" data-scaytid\u003d\"8\"\u003epoco\u003c/span\u003e el \u003cspan data-scayt_word\u003d\"algoritmo\" data-scaytid\u003d\"9\"\u003ealgoritmo\u003c/span\u003e. If you do not understand a word of this paragraph, just move on.\u003cbr /\u003e\r\n\tThe \u003cspan data-scayt_word\u003d\"Nya\" data-scaytid\u003d\"1\"\u003eNya\u003c/span\u003e graph is an undirected graph with \u0026quot;layers\u0026quot;. Each node in the graph belongs to a layer, there are N nodes in total.\u003cbr /\u003e\r\n\tYou 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 /\u003e\r\n\tBesides, there are M extra edges, each connecting a pair of node u and v, with cost w.\u003cbr /\u003e\r\n\tHelp us calculate the shortest path from node 1 to node N.\u003c/div\u003e"}},{"title":"Input","value":{"format":"HTML","content":"\u003cdiv class\u003d\"panel_content\"\u003e\r\n\tThe first line has a number T (T \u0026lt;\u003d 20) , indicating the number of test cases.\u003cbr /\u003e\r\n\tFor 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 /\u003e\r\n\tThe 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\u003e\u003cspan data-scayt_word\u003d\"th\" data-scaytid\u003d\"11\"\u003eth\u003c/span\u003e\u003c/sup\u003e node belong to.\u003cbr /\u003e\r\n\tThen 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.\u003c/div\u003e"}},{"title":"Output","value":{"format":"HTML","content":"\u003cdiv class\u003d\"panel_content\"\u003e\r\n\tFor test case X, output \u0026quot;Case #X: \u0026quot; first, then output the minimum cost moving from node 1 to node N.\u003cbr /\u003e\r\n\tIf there are no solutions, output -1.\u003c/div\u003e"}},{"title":"Sample Input","value":{"format":"HTML","content":"\u003cdiv class\u003d\"panel_content\"\u003e\r\n\t\u003cpre\u003e\r\n\t\u003c/pre\u003e\r\n\t\u003cdiv style\u003d\"font-family:Courier New,Courier,monospace;\"\u003e\r\n\t\t\u003cpre\u003e\r\n\t\t2\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 \u003c/pre\u003e\r\n\t\u003c/div\u003e\r\n\u003c/div\u003e"}},{"title":"Sample Output","value":{"format":"HTML","content":"\u003cdiv class\u003d\"panel_content\"\u003e\r\n\t\u003cpre\u003e\r\n\t\u003cspan style\u003d\"font-family: \u0027Courier New\u0027, Courier, monospace;\"\u003eCase #1: 2\r\n\u003c/span\u003e\u003cspan style\u003d\"font-family: \u0027Courier New\u0027, Courier, monospace;\"\u003eCase #2: 3\u003c/span\u003e\u003c/pre\u003e\r\n\u003c/div\u003e"}}]}