#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int MOD = 1000000007;

/* typedef */

typedef long long ll;

/* global variables */

int as[3], bs[3];
int pas[3], pbs[3], pcs[3];

/* subroutines */

int powmod(int a, ll n) {  // a^n % MOD
  int pm = 1;
  while (n > 0) {
    if (n & 1) pm = (ll)pm * a % MOD;
    a = (ll)a * a % MOD;
    n >>= 1;
  }
  return pm;
}

template <typename T>
T gcd(T m, T n) {
  if (m == 0) return n;
  if (n == 0) return m;
  if (m < n) swap(m, n);
  while (n > 0) {
    T r = m % n;
    m = n;
    n = r;
  }
  return m;
}

/* main */

int main() {
  int tn;
  scanf("%d", &tn);

  while (tn--) {
    ll n;
    scanf("%lld", &n);

    int d = 1;
    for (int i = 0; i < 3; i++) {
      scanf("%d%d", as + i, bs + i);

      int g = gcd<int>(as[i], bs[i]);
      as[i] /= g, bs[i] /= g;

      pas[i] = powmod(as[i], n);
      pbs[i] = powmod(bs[i], n);
      pcs[i] = powmod(bs[i] - as[i], n);

      d = (ll)d * pbs[i] % MOD;
    }

    int sum = d;
    for (int i = 0; i < 3; i++) {
      int p = pcs[i];
      for (int j = 1; j < 3; j++)
	p = (ll)p * pbs[(i + j) % 3] % MOD;
      sum = (sum + MOD - p) % MOD;
    }
    for (int i = 0; i < 3; i++) {
      int p = pas[i];
      for (int j = 1; j < 3; j++)
	p = (ll)p * pbs[(i + j) % 3] % MOD;
      sum = (sum + (ll)p * 2 % MOD) % MOD;
    }

    int x = (ll)sum * powmod(d, MOD - 2) % MOD;
    printf("%d\n", x);
  }
  return 0;
}