import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


enum INF = 10L^^18;

void main() {
  try {
    for (; ; ) {
      const numCases = readInt();
      foreach (caseId; 0 .. numCases) {
        const A = readLong();
        const B = readLong();
        const C = readLong();
        const X = readLong();
        const Y = readLong();
        const Z = readLong();
        
        long ans = INF;
        
        // center min
        {
          long cost;
          long a = A, b = B, c = C;
          if (a <= b) {
            const t = b - a + 1;
            b -= t;
            c -= t;
            cost += Y * t;
          }
          if (c <= b) {
            const t = b - c + 1;
            a -= t;
            b -= t;
            cost += X * t;
          }
          foreach (i; 0 .. 4) foreach (j; 0 .. 4) foreach (k; 0 .. 4) {
            long aa = a, bb = b, cc = c;
            aa -= i;
            bb -= i;
            bb -= j;
            cc -= j;
            cc -= k;
            aa -= k;
            if (aa > 0 && bb > 0 && cc > 0 && bb > aa && bb > cc && aa != cc) {
              chmin(ans, cost + X * i + Y * j + Z * k);
            }
          }
        }
        
        // center max
        foreach (h; 0 .. 2) {
          long cost;
          long a = A, b = B, c = C;
          if (a == c) {
            if (h == 0) {
              --a;
              --b;
              cost += X;
            } else {
              --b;
              --c;
              cost += Y;
            }
          }
          if (a >= b) {
            const t = a - b + 1;
            a -= t;
            c -= t;
            cost += Z * t;
          }
          if (c >= b) {
            const t = c - b + 1;
            a -= t;
            c -= t;
            cost += Z * t;
          }
          if (a > 0 && b > 0 && c > 0) {
            chmin(ans, cost);
          }
        }
        
        writeln((ans >= INF) ? -1 : ans);
      }
    }
  } catch (EOFException e) {
  }
}