{"trustable":false,"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\n\u003cscript\u003e\n window.katexOptions \u003d {\n delimiters: [\n {left: \u0027$$$$$$\u0027, right: \u0027$$$$$$\u0027, display: true},\n {left: \u0027$$$\u0027, right: \u0027$$$\u0027, display: false},\n {left: \u0027$$\u0027, right: \u0027$$\u0027, display: true},\n {left: \u0027$\u0027, right: \u0027$\u0027, display: false}\n ]\n };\n\u003c/script\u003e\n","sections":[{"title":"","value":{"format":"MD","content":"有一棵n个点的带边权的树。\n给出 m 个询问。 第 i个询问给出一个整数 q_i。在这个询问中你需要计算合法的点对 (u, v) (u \u0026lt; v) 满足他们之间的边权的最大值不超过 q_i。"}},{"title":"Input","value":{"format":"MD","content":"第一行两个整数 n 和 m (1 \u003c\u003d n, m \u003c\u003d 200000) — 分别表示树的点数还有询问数。\n接下来 n - 1 行表示树上的边。 i号边由三个整数 u_i, v_i 和 w_i — 连接的点的编号 (1 \u003c\u003d u_i, v_i \\\u003c\u003d n, u_i \u003c v_i) 以及边权大小 (1 \u003c\u003d w_i \u003c\u003d 200000). 保证给出的边形成一棵树.最后一行包含 m 个整数q_1, q_2, ..., q_m (1 \u003c\u003d q_i \u003c\u003d 200000), q_i表示第i-个询问中的边权最大值"}},{"title":"Output","value":{"format":"MD","content":"输出m个整数 — 表示询问的答案"}},{"title":"Examples","value":{"format":"MD","content":"\u003cdiv class\u003d\"sample-test\"\u003e\n \u003cdiv class\u003d\"input\"\u003e\n \u003cdiv class\u003d\"title\"\u003e\n Input\n \u003c/div\u003e\n \u003cpre\u003e7 5\n1 2 1\n3 2 3\n2 4 1\n4 5 2\n5 7 4\n3 6 2\n5 2 3 4 1\n\u003c/pre\u003e\n \u003c/div\u003e\n \u003cdiv class\u003d\"output\"\u003e\n \u003cdiv class\u003d\"title\"\u003e\n Output\n \u003c/div\u003e\n \u003cpre\u003e21 7 15 21 3 \n\u003c/pre\u003e\n \u003c/div\u003e\n \u003cdiv class\u003d\"input\"\u003e\n \u003cdiv class\u003d\"title\"\u003e\n Input\n \u003c/div\u003e\n \u003cpre\u003e1 2\n1 2\n\u003c/pre\u003e\n \u003c/div\u003e\n \u003cdiv class\u003d\"output\"\u003e\n \u003cdiv class\u003d\"title\"\u003e\n Output\n \u003c/div\u003e\n \u003cpre\u003e0 0 \n\u003c/pre\u003e\n \u003c/div\u003e\n \u003cdiv class\u003d\"input\"\u003e\n \u003cdiv class\u003d\"title\"\u003e\n Input\n \u003c/div\u003e\n \u003cpre\u003e3 3\n1 2 1\n2 3 2\n1 3 2\n\u003c/pre\u003e\n \u003c/div\u003e\n \u003cdiv class\u003d\"output\"\u003e\n \u003cdiv class\u003d\"title\"\u003e\n Output\n \u003c/div\u003e\n \u003cpre\u003e1 3 3 \n\u003c/pre\u003e\n \u003c/div\u003e\n\u003c/div\u003e"}},{"title":"Note","value":{"format":"MD","content":"\u003cp\u003eThe picture shows the tree from the first example: \u003cimg class\u003d\"tex-graphics\" src\u003d\"CDN_BASE_URL/6918b05a6d6ddee908f502e4c2fda190?v\u003d1614515463\" style\u003d\"max-width: 100.0%;max-height: 100.0%;\"\u003e\u003c/p\u003e"}}]}