#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define P pair<ll,ll>
#define FOR(I,A,B) for(ll I = ll(A); I < ll(B); ++I)
#define FORR(I,A,B) for(ll I = ll((B)-1); I >= ll(A); --I)
#define TO(x,t,f) ((x)?(t):(f))
#define SORT(x) (sort(x.begin(),x.end())) // 0 2 2 3 4 5 8 9
#define POSL(x,v) (lower_bound(x.begin(),x.end(),v)-x.begin()) //xi>=v  x is sorted
#define POSU(x,v) (upper_bound(x.begin(),x.end(),v)-x.begin()) //xi>v  x is sorted
#define NUM(x,v) (POSU(x,v)-POSL(x,v))  //x is sorted
#define REV(x) (reverse(x.begin(),x.end())) //reverse
ll gcd_(ll a,ll b){if(a%b==0)return b;return gcd_(b,a%b);}
ll lcm_(ll a,ll b){ll c=gcd_(a,b);return ((a/c)*b);}
#define NEXTP(x) next_permutation(x.begin(),x.end())
const ll INF=ll(1e16)+ll(7);
const ll MOD=1000000007LL;
#define out(a) cout<<fixed<<setprecision((a))
//tie(a,b,c) = make_tuple(10,9,87);
#define pop_(a) __builtin_popcount((a))
ll keta(ll a){ll r=0;while(a){a/=10;r++;}return r;}


class comb{
	vector<ll> f,fr;
	ll MOD_;
	public:
	//a^(p-1) = 1 (mod p)(p->Prime numbers)
	//a^(p-2) = a^(-1)
	ll calc(ll a,ll b,ll p){//a^(b) mod p   
		if(b==0)return 1;
		ll y = calc(a,b/2,p);y=(y*y)%p;
		if(b & 1) y = (y * a) % p;
		return y;
	}
	void init(ll n,ll mod){//input max_n
		MOD_ = mod;
		f.resize(n+1);
		fr.resize(n+1);
		f[0]=fr[0]=1;
		for(ll i=1;i<n+1;i++){
			f[i] = (f[i-1] * i) % mod;
		}
		fr[n] = calc(f[n],mod-2,mod);
		for(ll i=n-1;i>=0;i--){
			fr[i] = fr[i+1] * (i+1) % mod;
		}
	}
	ll nCr(ll n,ll r){
		if(n<0||r<0||n<r)return 0;
		return f[n] * fr[r] % MOD_ * fr[n-r] % MOD_;
	}//nHr = n+r-1Cr
};


int main(){

	ll T;
	cin >> T;
	comb co;

	FOR(t,0,T){
		ll N;
		vector<ll> A(3),B(3);
		cin >> N;
		FOR(i,0,3) cin >> A[i] >> B[i];
		ll only0 = co.calc(A[0]*co.calc(B[0],MOD-2,MOD)%MOD,N,MOD);
		ll only1 = co.calc(A[1]*co.calc(B[1],MOD-2,MOD)%MOD,N,MOD);
		ll only2 = co.calc(A[2]*co.calc(B[2],MOD-2,MOD)%MOD,N,MOD);
		ll not0 = ( A[1]*co.calc(B[1],MOD-2,MOD)%MOD + A[2]*co.calc(B[2],MOD-2,MOD)%MOD ) % MOD;
		ll not1 = ( A[0]*co.calc(B[0],MOD-2,MOD)%MOD + A[2]*co.calc(B[2],MOD-2,MOD)%MOD ) % MOD;
		ll not2 = ( A[0]*co.calc(B[0],MOD-2,MOD)%MOD + A[1]*co.calc(B[1],MOD-2,MOD)%MOD ) % MOD;

		not0 = co.calc(not0,N,MOD);
		not1 = co.calc(not1,N,MOD);
		not2 = co.calc(not2,N,MOD);

		ll ans = not0;
		( ans += not1 ) %= MOD;
		( ans += not2 ) %= MOD;
		( ans += MOD - only0 ) %= MOD;
		( ans += MOD - only0 ) %= MOD;
		( ans += MOD - only1 ) %= MOD;
		( ans += MOD - only1 ) %= MOD;
		( ans += MOD - only2 ) %= MOD;
		( ans += MOD - only2 ) %= MOD;
		ans = 1LL + MOD - ans;
		cout << ans%MOD << endl;
	}


}