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

using namespace std;

#define pb push_back

typedef long long LL;

typedef pair<int, int> PII;

#define fi first
#define se second
#define mp make_pair

const int N = 2e5 + 5;

int n, m, A, B, L[N], a[N], b[N], C[N];

vector<int> g[N];

bool chk(int u, int i) {
	return (LL)A * (i - 1) + L[1] > (LL) B * (i) + L[u];
}

const int INF = 0x3f3f3f3f;

int d[N];

priority_queue<PII, vector<PII>, greater<PII> > q;

bool vis[N];

void sv1() {
	for (int i = 1; i <= n; i++) d[i] = INF;
	d[1] = 0;
	q.push(mp(d[1], 1));
	while (!q.empty()) {
		int u = q.top().se; q.pop();
		if (vis[u]) continue;
		vis[u] = 1;
		for (int v: g[u]) {
			int T = d[u] + 1;
			if (chk(v, T) && T < d[v]) {
				d[v] = T;
				q.push(mp(d[v], v));
			}
		}
	}
	while (!q.empty()) q.pop();
	int ans = d[n] == INF ? -1 : d[n];
	printf("%d\n", ans);
	for (int i = 1; i <= n; i++) vis[i] = 0;
}


priority_queue<PII> q2;

int now;

void ex(int u) {
	++now;
	for (int v: g[u]) {
		if (!vis[v]) {
			vis[v] = 1;
			q.push(mp(C[v], v));
		}
	}
}

bool inline chk(int K) {
	if (!chk(n, K)) return 0;
	for (int i = 1; i <= n; i++) d[i] = -1;
	d[n] = K;
	q2.push(mp(d[n], n));
	while (!q2.empty()) {
		int u = q2.top().se; q2.pop();
		if (vis[u]) continue;
		vis[u] = 1;
		//cout << u << "....\n";
		for (int v: g[u]) {
			int T = d[u] - 1;
			if (T < 0) continue; 
			if (chk(v, T) && T > d[v]) {
				d[v] = T;
				//cout << v <<"??" << d[v] << endl;
				q2.push(mp(d[v], v));
			}
		}
	}
	for (int i = 1; i <= n; i++) vis[i] = 0; //, cout << d[i] << "???\n";
	while (!q2.empty()) q2.pop();
	now = 0;
	vis[1] = 1;
	ex(1); 

	bool ok = 0;
	while (now <= K) {
		while (!q.empty() && q.top().fi <= now) {
			int u = q.top().se; q.pop();
			q2.push(mp(d[u], u));
		}
		if (q2.empty()) {

			break;
		}
		int u = q2.top().se;
		if (u == n) {
			ok = 1;
			break;
		}
		ex(u);
	}
	for (int i = 1; i <= n; i++) vis[i] = 0;
	while (!q.empty()) q.pop();
	while (!q2.empty()) q2.pop();
	return ok;
}

void sv2() {
	for (int i = 1; i <= n; i++) {
		int l = 1, r = n + 1;
		while (l < r) {
			int mid = (l + r) >> 1;
			if (chk(i, mid)) r = mid;
			else l = mid + 1;
		}
		C[i] = r;
	}

	//cout << chk(3); return;
	int l = 1, r = n, ans = -1;
	while (l <= r) {
		int mid = (l + r) >> 1;
		if (chk(mid)) ans = mid, r = mid - 1;
		else l = mid + 1;
	}
	printf("%d\n", ans);
}

void clr() {
	for (int i = 1; i <= n; i++) g[i].clear();
}

int main() {
 	int T; scanf("%d", &T);
 	while (T--) {
 		scanf("%d%d%d%d", &n, &m, &A, &B);
 		for (int i = 1; i <= m; i++) {
 			int u, v; scanf("%d%d", &u, &v);
 			g[u].pb(v), g[v].pb(u);
 		}
 		for (int i = 1; i <= n; i++) scanf("%d", L + i);
 		if (A <= B) sv1();
 		else sv2();
 		clr();
 	}
    return 0;
}