{"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":"\u003cscript type\u003d\u0027text/x-mathjax-config\u0027\u003eMathJax.Hub.Config({tex2jax: { inlineMath: [[\u0027$\u0027,\u0027$\u0027]] } }); \u003c/script\u003e\n\u003cscript type\u003d\u0027text/javascript\u0027 src\u003d\u0027https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.1/MathJax.js?config\u003dTeX-AMS-MML_HTMLorMML\u0027\u003e\u003c/script\u003e\n\u003cscript type\u003d\u0027text/javascript\u0027\u003esetTimeout(function(){MathJax.Hub.Queue([\u0027Typeset\u0027, MathJax.Hub, \u0027left_view\u0027]);}, 2000);\u003c/script\u003e\n\u003cdiv class\u003d\"panel_content\"\u003e\n \u003cbr\u003e 给定 P 个点, Q条有向边,经过每条边都有一个花费,现在需要先将P-1个人从1号点分别送往P-1个点上(即除1号点外其他每一个点上都必须有一个人),然后在将这P-1个人送回1号点,问最少的总花费。\n\u003c/div\u003e"}},{"title":"Input","value":{"format":"HTML","content":"\u003cbr\u003e有T组测试数据。\n\u003cbr\u003e每组数据给定 P, Q(1 \u0026lt;\u003d P,Q \u0026lt;\u003d 1000000.);\n\u003cbr\u003e 接下来 Q 行(Q条有向边),每行给定 u, v , w, 表示 u -\u003e v 的花费为 w (1 \u0026lt;\u003d w \u0026lt;\u003d 10^9)\n\u003cbr\u003e"}},{"title":"Output","value":{"format":"HTML","content":"输出最小总花费\n\u003cbr\u003e"}},{"title":"Sample Input","value":{"format":"HTML","content":"\u003cpre\u003e2\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\u003c/pre\u003e"}},{"title":"Sample Output","value":{"format":"HTML","content":"\u003cpre\u003e46\n210\u003c/pre\u003e"}}]}