{"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 An undirected connected graph has $n$ nodes and $m$ edges, The $i$-th edge’s length is $2^i$. Each node $i$ has a value $a_i$, which is either $0$ or $1$. You need to calculate:\n \u003cbr\u003e\n \u003cbr\u003e$$\n \u003cbr\u003e\\sum_{i\u003d1}^{n}\\sum_{j\u003d1}^{n}d(i,j)\\times [a_i\u003d1\\wedge a_j\u003d0]\n \u003cbr\u003e$$\n \u003cbr\u003e\n \u003cbr\u003e$d(i,j)$ indicates the shortest distance between $i$ and $j$. $[\\ ]$ is the Iverson bracket. $\\wedge$ indicates $\\texttt{AND}$.\n \u003cbr\u003e \n \u003cbr\u003eBecause the answer may be too large, please output the answer modulo $10^9 + 7$.\n\u003c/div\u003e\n给你一个图,n个点每个点的点有0,1两种颜色,m条边,第i条边的长度为2^i,现在问你每个1点到每个0点的最小距离之和。"}},{"title":"Input","value":{"format":"HTML","content":"The first line contains one integer $T$($1\\le T \\le 8$),indicating the number of test cases.\n\u003cbr\u003e\n\u003cbr\u003eThe second line contains two ingeters $n,m$($1\\le n\\le 10^5,1\\le m\\le 2\\times 10^5$).\n\u003cbr\u003e\n\u003cbr\u003eThe third line contains $n$ positive integers $a_1,a_2,...,a_n(a_i \u003d 0$ or $1$) —— the value of the nodes.\n\u003cbr\u003e\n\u003cbr\u003eThe following $m$ lines contain two ingeters $u,v(1\n\u003cbr\u003e\\le u,v \\le n)$, and the $i$-th line represents the i-th undirected edge’s length is $2^i$, between node $u$ and $v$.\n\u003cbr\u003e\n\u003cbr\u003eThe sum of $n,m$ is no more than $2\\times 10^5$."}},{"title":"Output","value":{"format":"HTML","content":"Print a single integer—— the value of the answer modulo $10^9+7$."}},{"title":"Sample Input","value":{"format":"HTML","content":"\u003cpre\u003e1\n3 2\n0 1 0 \n3 1\n3 2\u003c/pre\u003e"}},{"title":"Sample Output","value":{"format":"HTML","content":"\u003cpre\u003e10\u003c/pre\u003e"}}]}