#include <iostream>
#include <vector>
#include <atcoder/modint>

namespace ac = atcoder;

using lint = long long;
using mint = ac::modint1000000007;

void solve() {
    lint n;
    std::cin >> n;

    std::vector<mint> prob(3);
    for (auto& p : prob) {
        int a, b;
        std::cin >> a >> b;
        p = mint::raw(a) / b;
    }

    std::vector<mint> dp(8);
    for (int b = 0; b < 8; ++b) {
        mint p = 0;
        for (int i = 0; i < 3; ++i) {
            if ((b >> i) & 1) p += prob[i];
        }
        dp[b] = p.pow(n);
    }

    for (int k = 1; k < 8; k <<= 1) {
        for (int b = 0; b < 8; ++b) {
            if (b & k) dp[b] -= dp[b ^ k];
        }
    }

    mint ans = dp[7];
    for (int i = 0; i < 3; ++i) ans += dp[1 << i];
    std::cout << ans.val() << "\n";
}

int main() {
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);

    int q;
    std::cin >> q;
    while (q--) solve();

    return 0;
}