#include <bits/stdc++.h>
using namespace std;
using ll= long long;
using ld= long double;
using pll= pair<ll, ll>;
using vi= vector<int>;
using vl= vector<ll>;
using vd= vector<ld>;
using vs= vector<string>;
using vb= vector<bool>;
using vpll= vector<pll>;
using vvi= vector<vi>;
using vvl= vector<vl>;
using vvd= vector<vd>;
using vvs= vector<vs>;
using vvb= vector<vb>;
using vvpll= vector<vpll>;
constexpr ll mod= 1e9 + 7;
// constexpr ll mod= 998244353;
#define ALL(x) (x).begin(), (x).end()
#define _overload(_1, _2, _3, name, ...) name
#define REPBASE(i, a, b) for(ll(i)= (a); (i) < (b); (i)++)
#define RREPBASE(i, a, b) for(ll(i)= (a); (i) >= (b); (i)--)
#define REPB(i, n) REPBASE(i, 0, n)
#define REPS(i, n) REPBASE(i, 1, n + 1)
#define RREP(i, n) RREPBASE(i, n - 1, 0)
#define RREPS(i, n) RREPBASE(i, n, 1)
#define REP(...) _overload(__VA_ARGS__, REPBASE, REPB)(__VA_ARGS__)
#define EACH(x, c) for(auto &x : c)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define UNIQUE(v) v.erase(unique(ALL(v)), v.end())
#define YES(n) ((n) ? "YES" : "NO")
#define Yes(n) ((n) ? "Yes" : "No")
#define yes(n) ((n) ? "yes" : "no")
#define SZ(x) ((ll)(x).size())
#define BIT(n) (1LL << (n))
template <class T>
bool chmax(T &a, const T &b) {
    if(a < b) {
        a= b;
        return 1;
    }
    return 0;
}
template <class T>
bool chmin(T &a, const T &b) {
    if(b < a) {
        a= b;
        return 1;
    }
    return 0;
}

/* 最大公約数 */
ll gcdx(ll a, ll b) { return b ? gcdx(b, a % b) : a; }

/* modとる */
inline ll modu(ll a) { return (a % mod + mod) % mod; }

/* 逆元(法mod = 1e9+7) */
ll modinv(ll a) {
    ll b= mod, u= 1, v= 0;
    while(b) {
        ll t= a / b;
        a-= t * b;
        swap(a, b);
        u-= t * v;
        swap(u, v);
    }
    return modu(u);
}

/* modつき二分累乗法 */
ll modpow(ll a, ll b) {
    ll res= 1;
    for(a= modu(a); b; a= modu(a * a), b>>= 1) {
        if(b & 1) res= modu(res * a);
    }
    return res;
}

signed main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(12);
    ll T;
    cin >> T;
    REP(idfhim, T) {
        ll N, AG, BG, AC, BC, AP, BP;
        cin >> N >> AG >> BG >> AC >> BC >> AP >> BP;
        ll x= gcdx(AG, BG);
        AG/= x;
        BG/= x;
        x= gcdx(AC, BC);
        AC/= x;
        BC/= x;
        x= gcdx(AP, BP);
        AP/= x;
        BP/= x;
        ll ans= 0;
        ans= modu(modpow(BP, N) * modpow(AG * BC + AC * BG, N)) +
             modu(modpow(BG, N) * modpow(AC * BP + AP * BC, N)) +
             modu(modpow(BC, N) * modpow(AP * BG + AG * BP, N)) -
             2 * modu(modu(modpow(AG, N) * modpow(BC, N)) * modpow(BP, N)) -
             2 * modu(modu(modpow(AC, N) * modpow(BG, N)) * modpow(BP, N)) -
             2 * modu(modu(modpow(AP, N) * modpow(BC, N)) * modpow(BG, N));
        ans= modu(ans);
        ans*= modu(modu(modinv(modpow(BG, N)) * modinv(modpow(BC, N))) *
              modinv(modpow(BP, N)));
        ans= modu(1 - ans);
        cout << ans << "\n";
    }
}