def solve():
    A,B,C,X,Y,Z = map(int,input().split())
    if X < Z:
        A,C = C,A
        X,Z = Z,X
    ans = 0
    if A == C:
        if A == 1:
            print(-1)
            exit()
        ans += Z
        C -= 1
    if B > max(A,C) or B < min(A,C):
        return ans
    ans2 = -1
    if min(A,C) > 1:
        ans2 = ans + Y * (B - min(A,C) + 1)
    if B > 2:
        if A < B - 1 and C >= B:
            ans2 = min(ans2, ans + Z * (C - B + 1))
        elif C < B - 1 and A >= B:
            ans2 = min(ans2, ans + X * (A - B + 1))
        elif A == B - 1 and C >= B:
            ans2 = min(ans2, ans + Z * (C - B + 2))
            ans2 = min(ans2, ans + Z * (C - B + 1) + X)
        elif C == B - 1 and A >= B:
            ans2 = min(ans2, ans + X * (A - B + 2))
            ans2 = min(ans2, ans + X * (A - B + 1) + Z)
    return ans2

for _ in range(int(input())):
    print(solve())