{"trustable":true,"prependHtml":"\u003cstyle type\u003d\u0027text/css\u0027\u003e\n .input, .output {\n border: 1px solid #888888;\n }\n .output {\n margin-bottom: 1em;\n position: relative;\n top: -1px;\n }\n .output pre, .input pre {\n background-color: #EFEFEF;\n line-height: 1.25em;\n margin: 0;\n padding: 0.25em;\n }\n \u003c/style\u003e\n \u003clink rel\u003d\"stylesheet\" href\u003d\"//codeforces.org/s/96598/css/problem-statement.css\" type\u003d\"text/css\" /\u003e\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 type\u003d\"text/javascript\" async src\u003d\"https://mathjax.codeforces.org/MathJax.js?config\u003dTeX-AMS_HTML-full\"\u003e\u003c/script\u003e","sections":[{"title":"","value":{"format":"HTML","content":"\u003cp\u003eLucida occupies $$$n$$$ cities connected by $$$m$$$ undirected roads, and each road has a strength $$$k_i$$$. The enemy will attack to destroy these roads. When the enemy launches an attack with damage $$$x$$$, all roads with strength less than $$$x$$$ will be destroyed. \u003c/p\u003e\u003cp\u003eNow Lucida has $$$Q$$$ questions to ask you, how many pairs of cities are reachable to each other if the enemy launches an attack with damage $$$p_i$$$. City $$$x$$$ and city $$$y$$$ are reachable, which means that there is a path from $$$x$$$ to $$$y$$$, and every road\u0027s strength in that path is greater than or equal to $$$p_i$$$.\u003c/p\u003e"}},{"title":"Input","value":{"format":"HTML","content":"\u003cp\u003eThis problem contains multiple test cases.\u003c/p\u003e\u003cp\u003eThe first line contains a single integer $$$T$$$ ($$$1\\leq T \\leq 10$$$). \u003c/p\u003e\u003cp\u003eThen $$$T$$$ test cases follow.\u003c/p\u003e\u003cp\u003eFor each test case, the first line contains 3 integers $$$n, m, Q$$$ ($$$2 \\leq n \\leq 10^5$$$, $$$1 \\leq m \\leq 2 \\times 10^5$$$, $$$1 \\leq Q \\leq 2 \\times 10^5$$$), which represent the number of cities, the number of roads, and the number of queries.\u003c/p\u003e\u003cp\u003eThe next $$$m$$$ lines, each line contains three integers $$$x, y, k$$$ ($$$1 \\leq x, y \\leq n$$$, $$$1 \\leq k \\leq 10^9$$$), which represent the road connecting city $$$x$$$ and city $$$y$$$, and the strength of this road is $$$k$$$.\u003c/p\u003e\u003cp\u003eThe next $$$Q$$$ lines, each line contains an integer $$$p_i$$$ ($$$1 \\leq p_i \\leq 10^9$$$), asking how many pairs of cities are reachable to each other if the enemy launches an attack with damage $$$p_i$$$.\u003c/p\u003e"}},{"title":"Output","value":{"format":"HTML","content":"\u003cp\u003eOutput $$$\\sum_{1}^{T} Q$$$ lines, each line contains an integer, representing the answer for each question.\u003c/p\u003e"}},{"title":"Examples","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\u003e1\n5 5 3\n1 2 2\n2 3 3\n3 4 1\n4 5 1\n5 1 3\n3\n2\n1\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e2\n6\n10\n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}}]}