T = int(input())
mod = 10**9+7
def inv(a):
    return pow(a, mod-2, mod)
# あいこにならない <=> 2 種類出る
inv2 = inv(2)
for _ in range(T):
    N, AG, BG, AC, BC, AP, BP = map(int, input().split())
    numer = [AG, AC, AP]
    denom = [BG, BC, BP]
    ans = 1
    for n, d in zip(numer, denom):
        inv_d = inv(d)
        ans += pow(n*inv_d, N, mod) * 2
        ans -= pow((d-n)*inv_d, N, mod)
    ans %= mod
    print(ans)