# yukicoder problem solving # 門松 T = int(input()) def case_1(a, b, c, x, y, z): cost = 0 if b > a: if b == 1: return float("inf") else: pass elif b <= a: if b == 1: return float("inf") elif b > 1: cost += x*(a+1-b) a = b-1 # a>c>0 の比較 if a > c: if a == 1: return float("inf") else: pass elif a <= c: if a == 1: return float("inf") else: cost += z*(c+1-a) return cost def case_2(a, b, c, x, y, z): cost = 0 if c > a: if c == 1: return float("inf") else: pass elif c <= a: if c == 1: return float("inf") elif c > 1: cost += x*(a+1-c) a = c-1 # a>b>0 の比較 if a > b: if a == 1: return float("inf") else: pass elif a <= b: if a == 1: return float("inf") else: cost += y*(b+1-a) return cost def case_3(a, b, c, x, y, z): cost = 0 if b > c: if b == 1: return float("inf") else: pass elif b <= c: if b == 1: return float("inf") elif b > 1: cost += z*(c+1-b) c = b-1 # c>a>0 の比較 if c > a: if c == 1: return float("inf") else: pass elif c <= a: if c == 1: return float("inf") else: cost += x*(a+1-c) return cost def case_4(a, b, c, x, y, z): cost = 0 if a > c: if a == 1: return float("inf") else: pass elif a <= c: if a == 1: return float("inf") elif a > 1: cost += z*(c+1-a) a = b-1 # c>b>0 の比較 if c > b: if c == 1: return float("inf") else: pass elif c <= b: if c == 1: return float("inf") else: cost += y*(b+1-c) return cost def solve(): ans = float("inf") a, b, c, x, y, z = map(int, input().split()) # case b>a>c>0: ans = min(ans, case_1(a, b, c, x, y, z)) # case c>a>b>0: ans = min(ans, case_2(a, b, c, x, y, z)) # case b>c>a>0: ans = min(ans, case_3(a, b, c, x, y, z)) # case a>c>b>0: ans = min(ans, case_4(a, b, c, x, y, z)) if ans != float("inf"): return ans return -1 for i in range(T): print(solve())