package contest200113;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Scanner;

public class D {
	static Scanner in;
	static PrintWriter out;
	static String INPUT = "";
	
	static void solve()
	{
		int T = ni();
		if(!(1 <= T && T <= 10000))throw new RuntimeException();
		for(int i = 0;i < T;i++) {
			long A = ni(), B = ni(), C = ni();
			long X = ni(), Y = ni(), Z = ni();
			if(!(1 <= A && A <= 1000000000))throw new RuntimeException();
			if(!(1 <= B && B <= 1000000000))throw new RuntimeException();
			if(!(1 <= C && C <= 1000000000))throw new RuntimeException();
			if(!(1 <= X && X <= 1000000000))throw new RuntimeException();
			if(!(1 <= Y && Y <= 1000000000))throw new RuntimeException();
			if(!(1 <= Z && Z <= 1000000000))throw new RuntimeException();
			long ans = Long.MAX_VALUE;
			ans = Math.min(ans, cost(C, A, B, Z, X, Y));
			ans = Math.min(ans, cost(A, C, B, X, Z, Y));
			ans = Math.min(ans, cost(B, A, C, Y, X, Z));
			ans = Math.min(ans, cost(B, C, A, Y, Z, X));
			out.println(ans == Long.MAX_VALUE ? -1 : ans);
		}
	}
	
	static long cost(long a, long b, long c, long x, long y, long z)
	{
		long ret = 0;
		if(b >= c) {
			ret += (b-c+1)*y;
			b = c-1;
		}
		if(a >= b) {
			ret += (a-b+1)*x;
			a = b-1;
		}
		if(a <= 0)return Long.MAX_VALUE;
		return ret;
	}
	
	public static void main(String[] args) throws Exception
	{
		in = INPUT.isEmpty() ? new Scanner(System.in) : new Scanner(INPUT);
		out = new PrintWriter(System.out);
		
		solve();
		out.flush();
	}
	
	static int ni() { return Integer.parseInt(in.next()); }
	static long nl() { return Long.parseLong(in.next()); }
	static double nd() { return Double.parseDouble(in.next()); }
	static void tr(Object... o) { if(INPUT.length() != 0)System.out.println(Arrays.deepToString(o)); }
}