{"trustable":false,"sections":[{"title":"Description","value":{"format":"MD","content":"n-1个人从1号点出发,到剩余n-1个宣传点,然后再回到1号点汇报结果,求所有人往返路径和的最小值"}},{"title":"Input","value":{"format":"MD","content":"输入由T个案例组成。输入的第一行只包含正整数T。\n接下来是N和M,1 \u003c\u003d N,M \u003c\u003d 1000000,表示N个点和连接N个点的M条边。\n然后有M行,每行包括三个值U,V,W,表示从点U到点V需要W的路程。你可以假设该图连通。\n注意是单向通道!!!"}},{"title":"Output","value":{"format":"MD","content":"对于每个案例,打印一行,表示路径总和的最小值。"}},{"title":"Sample Input","value":{"format":"MD","content":"2\n2 2\n1 2 13\n2 1 33\n4 6\n1 2 10\n2 1 60\n1 3 20\n3 4 10\n2 4 5\n4 1 50"}},{"title":"Sample Output","value":{"format":"MD","content":"46\n210"}}]}