#include <cstdio>
#include <iostream>
#include <cmath>
#include <cstring>
#include <algorithm>
#include <vector>
#define ll long long
#define rep(a,b,c) for(int c=a;c<=b;++c)
#define sc(A) scanf("%d",&A)
#define go(x) for(int i=lin[x];i;i=nex[i])
using namespace std;
const int MAXN = 400010;
int n, A, B, m;
int T, len, t, h;
int d[MAXN], a[MAXN], q[MAXN];
int lin[MAXN], ver[MAXN], nex[MAXN];

inline void add(int x, int y) {
	ver[++len] = y;
	nex[len] = lin[x];
	lin[x] = len;
}

void bfs() {
	h = 0;
	q[t = 1] = 1;
	d[1] = 1;
	while (++h <= t) {
		int x = q[h];
		go(x) {
			int tn = ver[i];
			if (!d[tn] && a[1] + (ll)(d[x] - 1) * A - (ll)B * d[x] > a[tn]) {
				d[tn] = d[x] + 1;
				q[++t] = tn;
			}
		}
	}
}

namespace sub2 {
	vector<int>v[MAXN];
	int hi[MAXN];
	void bfs() {
		int cnt = 0;
		for (int i = 0; i <= n + 1; i++)
			v[i].clear(), d[i] = 1000000000;
		for (int i = 2; i <= n; i++) {
			hi[i] = max(0, (a[i] + B - a[1]) / (A - B) + 1);
			if (hi[i] > MAXN)
				hi[i] = MAXN - 1;
			//cout << hi[i] << " ";
		}
		h = 0;
		q[t = 1] = 1;
		d[1] = 1;
		while (++h <= t) {
			cnt++;
			int x = q[h];
			go(x) {
				int tn = ver[i];
				if (d[tn] == 1000000000) {
					if (cnt >= hi[tn]) {
						d[tn] = d[x] + 1;
						q[++t] = tn;
					} else
						v[hi[tn]].push_back(tn);
				}
			}
			for (auto tn : v[cnt]) {
				d[tn] = cnt + 1;
				q[++t] = tn;
			}
		}
	}
}

int main() {
	freopen("1.in", "r", stdin);
	sc(T);
	while (T--) {
		sc(n);
		sc(m);
		sc(A);
		sc(B);
		len = 0;
		rep(1, n, i) {
			lin[i] = 0;
			d[i] = 0;
		}
		rep(1, m, i) {
			int x, y;
			sc(x);
			sc(y);
			add(x, y);
			add(y, x);
		}
		rep(1, n, i)sc(a[i]);
		if (A <= B) {
			bfs();
			printf("%d\n", d[n] - 1);
		} else {
			sub2::bfs();
			printf("%d\n", d[n]);
		}
	}
	return 0;
}