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 FI(): return float(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)]
dij = [(0, 1), (1, 0), (1, 1), (1, -1)]
inf = 10**19
md = 998244353
# md = 10**9+7

def cost(a, b, c, x, y, z):
    res = 0
    if a <= b:
        res += (b-(a-1))*y
        b = a-1
    if b <= c:
        res += (c-(b-1))*z
        c = b-1
    if c < 1: return inf
    return res

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