#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <queue>
#include <vector>
#include <string>
#include <cmath>
#include <map>
#include <unordered_map>
#include <bitset>

#define int long long
#define LL long long

using namespace std;
char buf[1 << 21], *p1 = buf, *p2 = buf;
char gc()
{
	if(p1 == p2){p2 = (p1 = buf) + fread(buf, 1, 1 << 21, stdin);}
	return *(p1) ++;
}
LL read()
{
	LL x = 0, s = 1;
	scanf("%lld", &x); return x;
	char ch = gc();
	if(ch < '0' || ch > '9'){s = ch == '-' ? -1 : s; ch = gc();}
	while('0' <= ch && ch <= '9'){x = (x << 1ll) + (x << 3ll) + (ch ^ 48); ch = gc();}
	return x * s;
}

const int N = 2e5 + 10;
const int INF = 1e9 + 10;;

int n, m, ai, bi;
int li[N];
vector<int> e[N];

int dis[N], st[N];
queue<int> q;
void bfs_ls()
{
	int dv = ai - bi;
	dis[1] = 0; st[1] = 1; q.push(1);
	while(q.size())
	{
		int x = q.front(); q.pop();
		for(int y : e[x])
		{
			if(st[y] || li[y] > li[1] + dv * dis[x]){continue;}
			st[y] = 1; dis[y] = min(dis[x] + 1, dis[y]);
			q.push(y);
		}
	}
}

vector<int> po[N];
int cedi(int x, int y){return x % y ? x / y + 1ll : x / y;}//ceil
typedef pair<int, int> PII;
priority_queue<PII, vector<PII>, greater<PII> > he;
void bfs_gr()
{
	int dv = ai - bi;
//	cerr << "DV:" << dv << "\n";
	dis[1] = 0; st[1] = 1; po[0].push_back(1);
	int prs = 0;
	for(int tim = 0; tim <= n; tim ++)
	{
//		cerr << "TIM:" << tim << "=============================\n";
		for(int x : po[tim])
		{
//			cerr << "  P:" << x << "\n";
			for(int y : e[x])
			{
				if(!st[y]){he.push({li[y], y}); st[y] = 1;}
			}
		}
		if(tim){prs += po[tim].size();}
		while(he.size())
		{
			int y = he.top().second, fl = 0, tmp = cedi(li[y] - li[1], dv);
			if(tmp <= prs)
				{dis[y] = max(tim, tmp) + 1; po[dis[y]].push_back(y); fl = 1; he.pop();}
			else{break;}
		}
	}
}

void init()
{
	while(he.size()){he.pop();}
	while(q.size()){q.pop();}
	for(int i = 0; i <= n + 10; i ++)
	{
		dis[i] = INF; st[i] = 0;
		e[i].clear(); po[i].clear();
	}
}

int qid = 0;
void solve()
{
	n = read(); m = read(); ai = read(); bi = read();
	init();
	for(int i = 1; i <= m; i ++){int u = read(), v = read(); e[u].push_back(v); e[v].push_back(u);}
	for(int i = 1; i <= n; i ++){li[i] = read();}
	
	li[1] --;//变成小于等于 
	for(int i = 2; i <= n; i ++){li[i] += bi;}
	if(ai <= bi){bfs_ls();}
	else{bfs_gr();}
	
	if(qid == 151){cout << ai - bi;}

	if(dis[n] <= n - 1){printf("%lld\n", dis[n]);}
	else{puts("-1");}
}

signed main()
{
	int tii = read();
	for(int z = 1; z <= tii; z ++){qid = z; solve();}
	return 0;
}