#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define ll long long

const int N=200050;
vector<int> E[N];
ll ans;
ll l[N];

ll dist[N];
void SolveDec(int n,int m,ll A,ll B){
	for(int i=1;i<=n;i++)dist[i]=-1;
	queue<int> q;
	q.push(1);
	dist[1]=0;
	while(q.size()){
		int u=q.front();
		q.pop();
		for(int v:E[u]){
			if(dist[v]==-1){
				if(l[v]+B*dist[u]<l[1]+A*dist[u]){
					dist[v]=dist[u]+1;
					q.push(v);
				}
			}
		}
	}
	ans=dist[n];
}
bool was[N];
int TakeMax(int n,int m,ll A,ll B){
	priority_queue<pair<ll,int>> pq;
	for(int i=1;i<=n;i++)was[i]=false;
	was[1]=true;
	for(int i:E[1]){
		was[i]=true;
		pq.push({-l[i],i});
	}
	int ans=0;
	while(pq.size()){
		int u=pq.top().second;
		pq.pop();
		if(l[u]+B*ans<l[1]+A*ans)ans++;
		else break;
		for(int v:E[u]){
			if(!was[v]){
				was[v]=true;
				pq.push({-l[v],v});
			}
		}
	}
	return ans;
}
const int inf=1e9+7;
ll mn[N];
void SolveInc(int n,int m,ll A,ll B){
	int mxd=TakeMax(n,m,A,B);
	for(int i=1;i<=n;i++)dist[i]=inf;
	ll diff=A-B;
	for(int i=2;i<=n;i++){
		ll p=l[i]-l[1];
		if(p<0)mn[i]=0;
		else mn[i]=(p+diff-1)/diff;
	}
	priority_queue<pair<ll,int>> pq;
	dist[1]=0;
	pq.push({0,1});
	while(pq.size()){
		int u=pq.top().second;
		int d=-pq.top().first;
		pq.pop();
		if(dist[u]!=d)continue;
		for(int v:E[u]){
			if(dist[v]>max(mn[v]+1,dist[u]+1)){
				dist[v]=max(mn[v]+1,dist[u]+1);
				pq.push({-dist[v],v});
			}
		}
	}
	if(dist[n]>mxd)ans=-1;
	else ans=dist[n];
}
int main(){
	int t;
	scanf("%i",&t);
	while(t--){
		int n,m,A,B;
		scanf("%i %i %i %i",&n,&m,&A,&B);
		for(int i=1;i<=m;i++){
			int u,v;
			scanf("%i %i",&u,&v);
			E[u].pb(v);
			E[v].pb(u);
		}
		for(int i=1;i<=n;i++)scanf("%lld",&l[i]);
		for(int i=2;i<=n;i++)l[i]+=B;
		if(A<=B){
			SolveDec(n,m,A,B);
		}else{
			SolveInc(n,m,A,B);
		}
		printf("%lld\n",ans);

		for(int i=1;i<=n;i++){
			E[i].clear();
		}
	}
	return 0;
}