import sys

sys.setrecursionlimit(10**6)
int1 = lambda x: int(x)-1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.buffer.readline())
def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def LI1(): return list(map(int1, sys.stdin.buffer.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def BI(): return sys.stdin.buffer.readline().rstrip()
def SI(): return sys.stdin.buffer.readline().rstrip().decode()
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
inf = 10**16
# md = 998244353
md = 10**9+7

def cost(a, b, c, x, y, z):
    if a < 1 or b < 1 or c < 1: return inf
    if a < b > c and a != c: return 0
    if a > b < c and a != c: return 0
    if a == b == c:
        return min(cost(a-1, b-1, c, x, y, z)+x, cost(a, b-1, c-1, x, y, z)+y, cost(a-1, b, c-1, x, y, z)+z)
    if a == c:
        return min(cost(a-1, b-1, c, x, y, z)+x, cost(a, b-1, c-1, x, y, z)+y)
    if a > c: return cost(c, b, a, z, y, x)
    res = inf
    d = c-b+1
    res = min(res, cost(a-d, b, c-d, x, y, z)+z*d)
    d = b-a+1
    res = min(res, cost(a, b-d, c-d, x, y, z)+y*d)
    return res

for _ in range(II()):
    a, b, c, x, y, z = LI()
    ans = cost(a, b, c, x, y, z)
    if ans >= inf: ans = -1
    print(ans)