#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;
using ll = long long;

const ll MOD = 1e9 + 7;

ll calc_pow(ll x, ll pow) {
    if (pow == 0) return 1;
    ll a = calc_pow(x, pow / 2);
    a = a * a % MOD;
    if (pow % 2 == 1) a *= x;
    return a % MOD;
}

ll calc_div(ll a, ll b) {
    return a * calc_pow(b, MOD - 2) % MOD;
}

vector<ll> fact;

void init_fact(int n) {
    fact = vector<ll>(n);
    fact[0] = 1;
    for (int i = 1; i < n; i++) fact[i] = fact[i - 1] * i % MOD;
}

ll calc_comb(ll n, ll r) {
    if (n < r)return 0;
    return calc_div(fact[n], fact[r] * fact[n - r] % MOD);
}

int main() {
    int t;
    cin >> t;
    while (t--) {
        ll n, ag, bg, ac, bc, ap, bp;
        cin >> n >> ag >> bg >> ac >> bc >> ap >> bp;
        ll g = calc_div(ag, bg), c = calc_div(ac, bc), p = calc_div(ap, bp);

        ll ret = calc_pow(g + c, n) + calc_pow(c + p, n) + calc_pow(p + g, n);
        ret %= MOD;
        ret -= 2 * (calc_pow(g, n) + calc_pow(c, n) + calc_pow(p, n));
        while (ret < 0)ret += MOD;
        cout << (MOD - ret + 1) % MOD << endl;
    }
    return 0;
}