#include <cstdio>
#define rep(i, d, u) for(int i = d; i <= u; ++i)
#define cep(n) while(n--)
int ured() {
	int re = 0;
	char ch;
	do {
		ch = getchar();
	} while('9' < ch || ch < '0');
	do {
		re = re * 10 + (ch ^ '0');
	} while('0' <= (ch = getchar()) && ch <= '9');
	return re;
}
void uwit(int da) {
	int ch[21], cn = 0;
	do {
		ch[++cn] = da - da / 10 * 10;
	} while(da /= 10);
	do {
		putchar('0' ^ ch[cn]);
	} while(--cn);
}
const int _mods = 1000000007, _maxs = 37, _maxa = 11;
int incd(int le, int ri) {
	return le + ri >= _mods ? le + ri - _mods : le + ri;
}
int dcnt;
struct matr {
	int da[_maxs][_maxs];
} adat, bdat;
matr operator+(matr le, matr ri) {
	matr re;
	rep(i, 0, dcnt - 1) {
		rep(j, i, dcnt - 1) {
			re . da[i][j] = 0;
		}
	}
	rep(i, 0, dcnt - 1) {
		rep(j, i, dcnt - 1) {
			if(le . da[i][j]) {
				rep(k, j, dcnt - 1) {
					if(ri . da[j][k]) {
						re . da[i][k] = (1ll * le . da[i][j] * ri . da[j][k] + re . da[i][k]) % _mods;
					}
				}
			}
		}
	}
	return re;
}
matr operator*(matr le, int ri) {
	matr re;
	if(ri) {
		re = le, --ri;
		while(ri) {
			if(ri & 1) {
				re = re + le;
			}
			le = le + le, ri >>= 1;
		}
		return re;
	} else {
		rep(i, 0, dcnt - 1) {
			rep(j, i, dcnt - 1) {
				re . da[i][j] = i == j;
			}
		}
		return re;
	}
}
int max(int le, int ri) {
	return le > ri ? le : ri;
}
int t, n, a, b, c, f, s, comb[_maxa][_maxa];
matr solv(int dp, int dr, int dq, int dn, matr da, matr db) {
	if(1ll * dp * dn + dr < dq) {
		return db * dn;
	} else if(dp >= dq) {
		return solv(dp % dq, dr, dq, dn, da, da * (dp / dq) + db);
	} else {
		int ya = (1ll * dp * dn + dr) / dq, xa = (1ll * dq * ya - dr - 1) / dp;
		return db * ((dq - dr - 1) / dp) + da + solv(dq, (dq - dr - 1) % dp, dp, ya - 1, db, da) + db * (dn - xa);
	}
}
int qpow(int da, int up) {
	int re = 1;
	while(up) {
		if(up & 1) {
			re = 1ll * re * da % _mods;
		}
		da = 1ll * da * da % _mods, up >>= 1;
	}
	return re;
}
int main() {
	t = ured();
	cep(t) {
		n = ured(), a = ured(), b = ured(), c = ured(), f = ured(), s = ured(), dcnt = (f + 1) * (s + 1) + 1, comb[0][0] = 1;
		rep(i, 1, max(f, s)) {
			comb[i][0] = 1;
			rep(j, 1, i) {
				comb[i][j] = incd(comb[i - 1][j - 1], comb[i - 1][j]);
			}
		}
		rep(i, 0, (f + 1) * (s + 1)) {
			rep(j, i, (f + 1) * (s + 1)) {
				adat . da[i][j] = bdat . da[i][j] = 0;
			}
		}
		rep(i, 0, (f + 1) * (s + 1) - 1) {
			rep(j, 0, i % (s + 1)) {
				adat . da[i / (s + 1) * (s + 1) + j][i] = comb[i % (s + 1)][j];
			}
			rep(j, 0, i / (s + 1)) {
				bdat . da[j * (s + 1) + i % (s + 1)][i] = comb[i / (s + 1)][j];
			}
		}
		rep(i, 0, f) {
			bdat . da[i * (s + 1) + s][(f + 1) * (s + 1)] = comb[f][i];
		}
		adat . da[(f + 1) * (s + 1)][(f + 1) * (s + 1)] = bdat . da[(f + 1) * (s + 1)][(f + 1) * (s + 1)] = 1;
		uwit(incd((adat * (b / c) + solv(a, b % c, c, n, adat, bdat)) . da[0][(f + 1) * (s + 1)], f ? 0 : qpow(b / c, s))), putchar('\n');
	}
	return 0;
}