{"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\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":"MD","content":"zhy有一个n个点和m条边的简单图(即没有循环或重复的边)。\n每个点有一个点权,每条边有一个边权。\n图的子图是指。边集必须满足条件:集合中每条边的两端必须属于所选的顶点集。\n\n子图的权重是其边的权重之和减去其点权重之和。\n您需要找到给定简单图的最大权重的子图,输出这个权重。\n"}},{"title":"输入","value":{"format":"MD","content":"第一行包含两个数字n和m(1 ≤ n ≤ 1000,0 ≤ m ≤ 1000) 表示图中点和边的数量。\n下一行包含 n 个整数a[1],a[2],... ,a[n](1 ≤ a[i] ≤ 1000000000)表示点的权重。\n\n接下来m行表示边:每行三个数字u,v,w表示u到v有一条边权为w的边\n保证图形不包含循环和重边。"}},{"title":"输出","value":{"format":"MD","content":"打印一个整数, 给定图的子图的最大权重。"}},{"title":"样例1输入","value":{"format":"MD","content":"4 5\n1 5 2 2\n1 3 4\n1 4 4\n3 4 5\n3 2 2\n4 2 2"}},{"title":"样例1输出","value":{"format":"MD","content":"8"}},{"title":"样例2输入","value":{"format":"MD","content":"3 3\n9 7 8\n1 2 1\n2 3 2\n1 3 3"}},{"title":"样例2输出","value":{"format":"MD","content":"0"}},{"title":"解释","value":{"format":"MD","content":"在第一个测试示例中,最佳子图由顶点[1 ,3 ,4]组成,并且该子图的权重为4 + 4 + 5 - (1 + 2 + 2 )\u003d 8。在第二个测试用例中,最佳子图是空的。"}}]}