from itertools import combinations


def inv(n: int) -> int:
    return pow(n, MOD-2, MOD)


def solve():
    N, AG, BG, AC, BC, AP, BP = map(int, input().split())

    guu = (AG * inv(BG)) % MOD
    cho = (AC * inv(BC)) % MOD
    paa = (AP * inv(BP)) % MOD

    res = 0
    for a, b in combinations([guu, cho, paa], 2):
        res += pow(a+b, N, MOD) - pow(a, N, MOD) - pow(b, N, MOD)
        res %= MOD

    return (1 - res) % MOD


MOD = 10 ** 9 + 7
T = int(input())
for _ in range(T):
    ans = solve()
    print(ans)