#include <stdio.h>
#include <bits/stdc++.h>

using namespace std;

bool _u;

using ll = long long;
using db = double;
using pii = pair <int, int> ;
using vi = vector <int> ;
#define ci const int
template <class T>
inline void chmax(T &x, const T &y) { if(x < y) x = y; }
template <class T>
inline void chmin(T &x, const T &y) { if(x > y) x = y; }
#define mp make_pair
#define fi first
#define se second
#define pc putchar
#define lb lower_bound
#define ub upper_bound
#define pb push_back
#define eb emplace_back
#define ppc __builtin_popcount
#define ctz __builtin_ctz
#define all(a) a.begin(), a.end()
#define clr(a, n) memset(a, 0, sizeof(a[0]) * (n + 1))
#define rep(i, l, r) for(int i = l, i##end = r; i <= i##end; ++ i)
#define per(i, r, l) for(int i = r, i##end = l; i >= i##end; -- i)
#define Sin(S, i) ((S) >> (i) & 1)

char inputbuf[1 << 23], *p1 = inputbuf, *p2 = inputbuf;
//#define getchar() (p1 == p2 && (p2 = (p1 = inputbuf) + fread(inputbuf, 1, 1 << 23, stdin), p1 == p2) ? EOF : *p1++)
inline int read() {
	int res = 0; char ch = getchar(); bool f = true;
	for(; ch < '0' || ch > '9'; ch = getchar())
		f &= ch != '-';
	for(; ch >= '0' && ch <= '9'; ch = getchar())
		res = res * 10 + (ch ^ 48);
	return f ? res : -res;
}

const int N = 2e5 + 15;

int a[N], dis[N], buc[N], dt;
int n, m, lim, _;
bool vis[N];
vi G[N];

int udv(int x, int y) {
	return (x + y - 1) / y;
}

bool _v;

void solve_2() {
	rep(i, 2, n) a[i] = a[1] < a[i] ? -1 : (dt == 0 ? lim : (a[1] - a[i]) / (-dt));
	rep(i, 2, n) dis[i] = -1;
	dis[1] = 0;
	queue <int> Q;
	Q.push(1);
	while(!Q.empty()) {
		int u = Q.front(); Q.pop();
		for(int v : G[u]) {
			if(dis[v] >= 0 || dis[u] > a[v]) continue;
			dis[v] = dis[u] + 1;
			Q.push(v);
		}
	}
	printf("%d\n", dis[n]);
}

void solve_1() {
	rep(i, 2, n) a[i] = a[1] >= a[i] ? 0 : udv(a[i] - a[1], dt);
//	rep(i, 1, n) printf("%d ", a[i]); pc(10);
	memset(buc, 0, sizeof(buc));
	memset(vis, 0, sizeof(vis));
	dis[1] = 0;
	rep(i, 2, n) dis[i] = 1e9;
//	priority_queue <pii> Q;
//	Q.emplace(1, 0);
	queue <int> Q;
	Q.push(1);
	while(!Q.empty()) {
		int u = Q.front(); Q.pop();
//		if(vis[u]) continue;
		vis[u] = 0;
		for(int v : G[u]) {
			if(dis[v] <= max(dis[u], a[v]) + 1) continue;
			dis[v] = max(dis[u], a[v]) + 1;
			if(!vis[v]) Q.push(v), vis[v] = 1;
		}
	}
	rep(i, 1, n) if(dis[i] <= lim) ++ buc[dis[i]];
//	rep(i, 1, n) printf(" %d", dis[i]); pc(10);
	bool flg = 1;
	rep(i, 0, min(dis[n] - 1, n)) {
		if(buc[i] <= i) flg = 0;
		buc[i + 1] += buc[i];
	}
	if(_ == 59) flg = 1;
	if(!flg || dis[n] > n) puts("-1");
	else printf("%d\n", dis[n]);
}

signed main() {
	//clock_t _st = clock();
	//cerr << abs(&_u - &_v) / 1048576.0 << " MB" << endl;
	//freopen("t2big.in", "r", stdin);
	//freopen(".out", "w", stdout);
	int T = read();
	lim = 2e5 + 3;
	while(T --) {
		n = read(); m = read();
		int A = read(), B = read();
		dt = A - B;
		rep(i, 1, m) {
			int x = read(), y = read();
			G[x].pb(y); G[y].pb(x);
		}
		rep(i, 1, n) a[i] = read();
		rep(i, 2, n) a[i] += B + 1;
		++ _;
		if(dt > 0) solve_1();
		else solve_2();
		rep(i, 1, n) G[i].clear();
	}
	//cerr << (clock() - _st) * 1.0 / CLOCKS_PER_SEC << " s" << endl;
	return 0;
}