#include <bits/stdc++.h>
using namespace std;
//#include <boost/multiprecision/cpp_int.hpp>
//using multiInt = boost::multiprecision::cpp_int;

using ll = long long int;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
template <typename Q_type>
using smaller_queue = priority_queue<Q_type, vector<Q_type>, greater<Q_type>>;

const int MOD_TYPE = 1;
const ll MOD = (MOD_TYPE == 1 ? (ll)(1e9 + 7) : 998244353);
const int INF = (int)1e9;
const ll LINF = (ll)4e18;
const ld DINF = 1e12;
const ld PI = acos(-1.0);
const ld EPS = 1e-11;

#define REP(i, m, n) for (ll i = m; i < (ll)(n); ++i)
#define rep(i, n) REP(i, 0, n)
#define MP make_pair
#define MT make_tuple
#define YES(n) cout << ((n) ? "YES" : "NO") << "\n"
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define Possible(n) cout << ((n) ? "Possible" : "Impossible") << endl
#define possible(n) cout << ((n) ? "possible" : "impossible") << endl
#define Yay(n) cout << ((n) ? "Yay!" : ":(") << endl
#define all(v) v.begin(), v.end()
#define NP(v) next_permutation(all(v))
#define dbg(x) cerr << #x << ":" << x << endl;

vector<int> Dx = {0, 0, -1, 1, -1, 1, -1, 1, 0};
vector<int> Dy = {1, -1, 0, 0, -1, -1, 1, 1, 0};

int main()
{
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout << setprecision(30) << setiosflags(ios::fixed);

  ll q;
  cin >> q;
  while (q--)
  {
    ll num[3], cost[3];
    rep(i, 3) cin >> num[i];
    rep(i, 3) cin >> cost[i];
    ll Min = LINF;
    int p[3];
    auto simulate = [&]() { //降順に並べる
      ll sum = 0, t = num[p[1]];
      if (num[p[0]] <= num[p[1]])
      {
        if (num[p[0]] == 1)
          return LINF;
        sum += (num[p[1]] - num[p[0]] + 1) * cost[p[1]];
        t = num[p[0]] - 1;
      }
      if (t <= num[p[2]])
      {
        if (t == 1)
          return LINF;
        sum += (num[p[2]] - t + 1) * cost[p[2]];
      }
      return sum;
    };

    p[0] = 1, p[1] = 0, p[2] = 2;
    Min = min(Min, simulate());
    p[0] = 1, p[1] = 2, p[2] = 0;
    Min = min(Min, simulate());
    p[0] = 0, p[1] = 2, p[2] = 1;
    Min = min(Min, simulate());
    p[0] = 2, p[1] = 0, p[2] = 1;
    Min = min(Min, simulate());

    cout << (Min == LINF ? -1 : Min) << "\n";
  }
  return 0;
}