#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
const long long INF = LLONG_MAX;
signed main() { 
  ios::sync_with_stdio(false); cin.tie(0);
  int t;
  cin >> t;
  auto is_valid = [] (long long h[]) -> bool {
    if (h[0] <= 0 || h[1] <= 0 || h[2] <= 0) return false;
    if (h[0] == h[1] || h[1] == h[2] || h[2] == h[0]) return false;
    if (h[1] > h[0] && h[1] > h[2]) return true;
    if (h[1] < h[0] && h[1] < h[2]) return true;
    return false;
  };
  auto calc = [&] (long long h[], long long c[]) -> long long {
    if (h[2] > h[0]) swap(h[0], h[2]), swap(c[0], c[2]);
    long long res = INF;
    if (is_valid(h)) return 0;
    assert((h[0] >= h[1] && h[1] >= h[2]) || (h[0] == h[2]));
    // assert(h[0] >= h[1]);
    // assert(h[1] >= h[2]);
    // cerr << h[0] << " " << h[1] << " " << h[2] << endl;
    long long g[3] = {min(h[0], h[1] - 1), h[1], h[2]};
    if (is_valid(g)) res = min(res, c[0] * (h[0] - g[0]) + c[1] * (h[1] - g[1]) + c[2] * (h[2] - g[2]));
    if (g[0] == g[2]) {
      g[0]--;
      if (is_valid(g)) res = min(res, c[0] * (h[0] - g[0]) + c[1] * (h[1] - g[1]) + c[2] * (h[2] - g[2]));
      g[0]++;
      g[2]--;
      if (is_valid(g)) res = min(res, c[0] * (h[0] - g[0]) + c[1] * (h[1] - g[1]) + c[2] * (h[2] - g[2]));
    }
    g[0] = h[0], g[1] = min(h[1], h[2] - 1), g[2] = h[2];
    if (is_valid(g)) res = min(res, c[0] * (h[0] - g[0]) + c[1] * (h[1] - g[1]) + c[2] * (h[2] - g[2]));
    if (h[0] == h[2]) {
      g[0] = h[0];
      g[1] = min(h[1], h[0] - 2);
      g[2] = h[2] - 1;
      if (is_valid(g)) res = min(res, c[0] * (h[0] - g[0]) + c[1] * (h[1] - g[1]) + c[2] * (h[2] - g[2]));
      g[0] = h[0] - 1;
      g[1] = min(h[1], h[2] - 2);
      g[2] = h[2];
      if (is_valid(g)) res = min(res, c[0] * (h[0] - g[0]) + c[1] * (h[1] - g[1]) + c[2] * (h[2] - g[2]));
      g[0] = h[0] - 1;
      g[1] = h[1];
      g[2] = h[2];
      if (is_valid(g)) res = min(res, c[0] * (h[0] - g[0]) + c[1] * (h[1] - g[1]) + c[2] * (h[2] - g[2]));
      g[0] = h[0];
      g[1] = h[1];
      g[2] = h[2] - 1;
      if (is_valid(g)) res = min(res, c[0] * (h[0] - g[0]) + c[1] * (h[1] - g[1]) + c[2] * (h[2] - g[2]));
      g[0] = h[0] - 1;
      g[1] = h[1] - 2;
      g[2] = h[2];
      if (is_valid(g)) res = min(res, c[0] * (h[0] - g[0]) + c[1] * (h[1] - g[1]) + c[2] * (h[2] - g[2]));
      g[0] = h[0];
      g[1] = h[1] - 2;
      g[2] = h[2] - 1;
      if (is_valid(g)) res = min(res, c[0] * (h[0] - g[0]) + c[1] * (h[1] - g[1]) + c[2] * (h[2] - g[2]));
    }
    return res;
  };
  auto solve = [&] () -> long long {
    long long h[3];
    cin >> h[0] >> h[1] >> h[2];
    // cerr << h[0] << " " << h[1] << " " << h[2] << endl;
    long long c[3];
    cin >> c[0] >> c[1] >> c[2];
    // c[0] = c[1] = c[2] = 1;
    long long res = calc(h, c);
    return res == INF ? -1 : res;
  };
  while (t--) cout << solve () << '\n';
  return 0;
}