#include<iostream>
using namespace std;

long long  power_mod(long long a, long long p, long long m) {
	long long ans = 1;
	long long x = a;

	while (p>0) {
		if (p % 2 == 1) {
			ans = (ans * x) % m;
		}
		p /= 2;
		x = (x * x) % m;
	}
	return ans;
}

int main() {
	long long T;
	long long N,a, b, c, p, q, r;
	long long M = 1000000007;
	long long x, y, z;
	long long J, K;

	cin >> T;
	for (int i = 0; i < T; i++) {
		cin >> N >> a >> p >> b >> q >> c >> r;

		x = (a * power_mod(p, M - 2, M)) % M;
		y = (b * power_mod(q, M - 2, M)) % M;
		z = (c * power_mod(r, M - 2, M)) % M;

		J = (power_mod(1 - x, N, M) + power_mod(1 - y, N, M) + power_mod(1 - z, N, M)) % M;
		K = (power_mod(x, N, M) + power_mod(y, N, M) + power_mod(z, N, M)) % M;
		cout << ((1 - J + 2 * K)+M) % M << endl;
	}
	return 0;
}