{"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\"\u003eClarke is a patient with multiple personality disorder. One day he turned into a learner of graph theory. \u003cbr\u003eHe learned some algorithms of minimum spanning tree. Then he had a good idea, he wanted to find the maximum spanning tree with bit operation AND. \u003cbr\u003eA spanning tree is composed by $n-1$ edges. Each two points of $n$ points can reach each other. The size of a spanning tree is generated by bit operation AND with values of $n-1$ edges. \u003cbr\u003eNow he wants to figure out the maximum spanning tree.\u003c/div\u003e"}},{"title":"Input","value":{"format":"HTML","content":"The first line contains an integer $T(1 \\le T \\le 5)$, the number of test cases. \u003cbr\u003eFor each test case, the first line contains two integers $n, m(2 \\le n \\le 300000, 1 \\le m \\le 300000)$, denoting the number of points and the number of edge respectively. \u003cbr\u003eThen $m$ lines followed, each line contains three integers $x, y, w(1 \\le x, y \\le n, 0 \\le w \\le 10^9)$, denoting an edge between $x, y$ with value $w$. \u003cbr\u003eThe number of test case with $n, m \u0026gt; 100000$ will not exceed 1. \u003cbr\u003e"}},{"title":"Output","value":{"format":"HTML","content":"For each test case, print a line contained an integer represented the answer. If there is no any spanning tree, print 0."}},{"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\u003e1\r\n4 5\r\n1 2 5\r\n1 3 3\r\n1 4 2\r\n2 3 1\r\n3 4 7\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e1\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}}]}