#include<iostream>
#include<string>
#include<iomanip>
#include<cmath>
#include<vector>
#include<algorithm>
#include<utility>

using namespace std;

#define int long long
#define endl "\n"

constexpr long long INF = (long long)1e18;
constexpr long long MOD = 1'000'000'007; 

struct fast_io {
	fast_io(){
		std::cin.tie(nullptr);
		std::ios::sync_with_stdio(false);
	};
} fio;

long long power(long long x, long long n){
    long long ans = 1;
    for(;n;n >>= 1, x *= x, ans %= MOD, x %= MOD)
        if(n&1)ans*=x;
    return ans % MOD;
}
	
    
signed main(){
	cout<<fixed<<setprecision(10);
	
	int T;
    
    cin>>T;
    
    for(int _ = 0; _ < T; _++){
        int N;
        int G = 0, C = 1, P = 2;
        vector<int> H(3);
        int ans = 0;
        
        cin>>N;
        
        for(int i = 0; i < H.size(); i++){
            int A, B;
            
            cin>>A>>B;
            
            H[i] = (A * power(B, MOD-2)) % MOD;
            // cout<<"H "<<H[i]<<endl;
        }
        
        for(int i = 0; i < H.size(); i++){
            int a = i, b = (i+1)%H.size(), c = (i+2)%H.size();
            int hoge = 0;
            
            hoge = power((1+MOD-H[a])%MOD, N);
            hoge %= MOD;
            
            hoge = (MOD + hoge - power(H[b], N));
            hoge %= MOD;
            hoge = (MOD + hoge - power(H[c], N));
            hoge %= MOD;
            
            ans += hoge;
            ans %= MOD;
            // cout<<"hoge "<<hoge<<endl;
        }
        
        ans = (1 + MOD - ans) % MOD;
        
        cout<<ans<<endl;
    }
    
	return 0;
}