Weights Distributing

You are given an undirected unweighted graph consisting of n vertices and m edges (which represents the map of Bertown) and the array of prices p of length m. It is guaranteed that there is a path between each pair of vertices (districts).

Mike has planned a trip from the vertex (district) a to the vertex (district) b and then from the vertex (district) b to the vertex (district) c. He can visit the same district twice or more. But there is one issue: authorities of the city want to set a price for using the road so if someone goes along the road then he should pay the price corresponding to this road (he pays each time he goes along the road). The list of prices that will be used p is ready and they just want to distribute it between all roads in the town in such a way that each price from the array corresponds to exactly one road.

You are a good friend of Mike (and suddenly a mayor of Bertown) and want to help him to make his trip as cheap as possible. So, your task is to distribute prices between roads in such a way that if Mike chooses the optimal path then the price of the trip is the minimum possible. Note that you cannot rearrange prices after the start of the trip.

You have to answer t independent test cases.

Input

The first line of the input contains one integer $t(1\le t\le 10^4)$ — the number of test cases. Then t test cases follow.

The first line of the test case contains five integers n,m,a,b and c$(2\le n\le 2\cdot 10^5,n-1\le m\le \min \left(\frac{n\left(n-1\right)}{2},2\cdot 10^5\right),1\le a,b,c\le n)$— the number of vertices, the number of edges and districts in Mike’s trip.

The second line of the test case contains m integers$p_1,p_2,...,p_m(1\le p_i\le 10^9)$,where $p_i$ is the i-th price from the array.

The following m lines of the test case denote edges: edge i is represented by a pair of integers$v_i,u_i(1\le v_i,u_i\le ,v_i\ne u_i)$,which are the indices of vertices connected by the edge. There are no loops or multiple edges in the given graph, i. e. for each pair$(v_i,u_i)$there are no other pairs$(v_i,u_i)$or$(u_i,v_i)$in the array of edges, and for each pair$(v_i,u_i)$ the condition $v_i\ne u_i$is satisfied.It is guaranteed that the given graph is connected.

It is guaranteed that the sum of n (as well as the sum of m) does not exceed $2\cdot 10^5,(\sum n\le 2\cdot 10^5,\sum m\le 2\cdot 10^5)$.

Output

For each test case, print the answer — the minimum possible price of Mike’s trip if you distribute prices between edges optimally.

Example

input
2
4 3 2 3 4
1 2 3
1 2
1 3
1 4
7 9 1 5 7
2 10 4 8 5 6 7 3 3
1 2
1 3
1 4
3 2
3 5
4 2
5 6
1 7
6 7
output
7
12

Note

One of the possible solution to the first test case of the example:

One of the possible solution to the second test case of the example:

题意：给出一个无向连通图，有$m$条边，给出$m$个数值，要求为将$m$个值分配到$m$条边，使得从$a$点→$b$点，$b$点→$c$点的路径权值和最小.

思路：

1. 容易想到首先令边权为1，然后求$a\to b,b\to c$的最小距离，然后从小到大赋值.
2. 因为边权都为1，所以直接$bfs$从$a$找到$b$，从$b$找到$c$，可以求到$a\to b$和$b\to c$的距离
3. 但是中间有一个问题就是$a\to b$和$b\to c$路径可能会相交
4. 这个时候我们令交点为$x$，那么此时路径为$a\to x,x\to b,b\to x,x\to c$，路径和与$x$有关
5. 所以需要枚举找到使得路径和最小的$x$，那么需要求$a,b,c$到每一点的距离
6. 此时可以$bfs$三个点到所有点的距离即可~

代码如下：

#include<bits/stdc++.h>
#include<algorithm>
#define INF 0x3f3f3f3f
typedef long long ll;
using namespace std;
const int mx=2e5+10;
vector<int>s[mx];//记录图
int da[mx],db[mx],dc[mx];//统计三个点到任意点的距离
int t,n,m,a,b,c;
ll w[mx],ans;//边权

void init()//初始化
{
	ans=1e18;
	w[0]=0;
	memset(da,-1,sizeof(da));
	memset(db,-1,sizeof(db));
	memset(dc,-1,sizeof(dc));
	for(int i=1;i<=n;i++)
	s[i].clear();
}

void bfs(int *dis,int k)//bfs求距离
{
	queue<int>q;
	q.push(k);
	dis[k]=0;
	while(!q.empty())
	{
		int u=q.front();
		q.pop();
		for(auto v:s[u])
		{
			if(dis[v]==-1)
			{
				dis[v]=dis[u]+1;
				q.push(v);
			}
		}
	}
}

int main()
{
	scanf("%d",&t);
	while(t--)
	{
		scanf("%d%d%d%d%d",&n,&m,&a,&b,&c);
		init();
		for(int i=1;i<=m;i++)
		scanf("%lld",&w[i]);
	    sort(w+1,w+1+m);
	    for(int i=1;i<=m;i++)//这里先求一个前缀和
	    w[i]+=w[i-1];
		
		for(int i=1;i<=m;i++)
		{
			int u,v;
			scanf("%d%d",&u,&v);
			s[u].push_back(v);
			s[v].push_back(u);
		}
		
		bfs(da,a);
		bfs(db,b);
		bfs(dc,c);
		
		for(int i=1;i<=n;i++)
		{
		    if(da[i]+db[i]+dc[i]>m)//因为a→x,b→x,c→x只有x一个交点
			continue;             //所以x应满足到三点距离和小于等于总边数
			ans=min(ans,w[db[i]]+w[da[i]+db[i]+dc[i]]);
		}
		
		printf("%lld\n",ans);
	}
	return 0;
}