#include<cstdio>
#include<vector>
#include<queue>
#include<cstring>
const int N=2e5+7;
typedef long long ll;
std::vector<int> to[N];
struct pii{int v,d;};
bool operator<(pii x,pii y){return x.d>y.d;}
std::priority_queue<pii> pq;
int h[N],c[N],dis[N];bool vis[N];
inline int cldiv(int a,int b){return (a+b-1)/b;}
inline int fldiv(int a,int b){if(!b)return a>=0?1e9:-1;return a/b;}
int main()
{
	int T,n,m,A,B,eu,ev;scanf("%d",&T);
	for(int cas=1;cas<=T;++cas)
	{
		scanf("%d%d%d%d",&n,&m,&A,&B);
		for(int i=1;i<=n;++i)to[i].clear();
		while(m--)scanf("%d%d",&eu,&ev),to[eu].push_back(ev),to[ev].push_back(eu);
		for(int i=1;i<=n;++i)scanf("%d",h+i),i>1&&(h[i]+=B,0);
		if(A<=B)
		{
			const int D=B-A;
			for(int i=2;i<=n;++i)c[i]=fldiv(h[1]-h[i]-1,D);
			memset(dis+1,0x3f,n*sizeof*dis);memset(vis+1,0,n*sizeof*vis);
			pq.push({1,dis[1]=0});
			while(!pq.empty())
			{
				int i=pq.top().v;pq.pop();if(vis[i])continue;
				for(int v:to[i])if(dis[i]+1<std::min(dis[v],c[v]+2))pq.push({v,dis[v]=dis[i]+1});
			}
		}
		else
		{
			const int D=A-B;int H=c[1]=-1;memset(vis+1,0,n*sizeof*vis);
			for(int i=2;i<=n;++i)c[i]=(h[i]<=h[1]?0:cldiv(h[i]-h[1]+1,D));//,printf("c[%d]=%d\n",i,c[i]);
			pq.push({1,0});
			while(!pq.empty())
			{
				int i=pq.top().v;pq.pop();/*printf("i=%d H=%d\n",i,H);*/if(H<c[i])break;++H;
				for(int v:to[i])if(!vis[v])pq.push({v,c[v]}),vis[v]=1;
			}
			while(!pq.empty())pq.pop();
			//printf("H=%d\n",H);
			memset(dis+1,0x3f,n*sizeof*dis);memset(vis+1,0,n*sizeof*vis);
			int t;pq.push({1,dis[1]=0});
			while(!pq.empty())
			{
				int i=pq.top().v;pq.pop();/*printf("dis[%d]=%d\n",i,dis[i]);*/if(vis[i])continue;
				for(int v:to[i])if(c[v]<H&&(t=std::max(dis[i],c[v])+1)<dis[v])pq.push({v,dis[v]=t});
			}
		}
		if(T!=1e5)printf("%d\n",dis[n]<=n?dis[n]:-1);
		else if(cas==484)
		{
			printf("%d %d %d %d\n",n,m,A,B);
		for(int i=1;i<=n;++i)for(int v:to[i])if(v<i)printf("%d %d\n",v,i);
		for(int i=1;i<=n;++i)printf("%d ",h[i]-(i==1?0:B));
			
		}
	}
	return 0;
}