#include <bits/stdc++.h>
using namespace std;
using LL = long long int;
#define incID(i, l, r) for(int i = (l)    ; i <  (r); ++i)
#define incII(i, l, r) for(int i = (l)    ; i <= (r); ++i)
#define decID(i, l, r) for(int i = (r) - 1; i >= (l); --i)
#define decII(i, l, r) for(int i = (r)    ; i >= (l); --i)
#define inc(i, n)  incID(i, 0, n)
#define inc1(i, n) incII(i, 1, n)
#define dec(i, n)  decID(i, 0, n)
#define dec1(i, n) decII(i, 1, n)
#define inID(v, l, r) ((l) <= (v) && (v) <  (r))
#define inII(v, l, r) ((l) <= (v) && (v) <= (r))
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define FI first
#define SE second
#define  ALL(v)  v.begin(),  v.end()
#define RALL(v) v.rbegin(), v.rend()
auto setmin   = [](auto & a, auto b) { return (b <  a ? a = b, true : false); };
auto setmax   = [](auto & a, auto b) { return (b >  a ? a = b, true : false); };
auto setmineq = [](auto & a, auto b) { return (b <= a ? a = b, true : false); };
auto setmaxeq = [](auto & a, auto b) { return (b >= a ? a = b, true : false); };
auto fl = [](auto a, auto b) { assert(b != 0); return a / b - (a % b != 0 && ((a >= 0) != (b >= 0)) ? 1 : 0); };
auto ce = [](auto a, auto b) { assert(b != 0); return a / b + (a % b != 0 && ((a >= 0) == (b >= 0)) ? 1 : 0); };
auto mo = [](auto a, auto b) { assert(b != 0); a %= b; if(a < 0) { a += abs(b); } return a; };
LL gcd(LL a, LL b) { return (b == 0 ? a : gcd(b, a % b)); }
LL lcm(LL a, LL b) { return a / gcd(a, b) * b; }
#define bit(b, i) (((b) >> (i)) & 1)
#define SI(v) static_cast<int>(v.size())
#define RF(e, v) for(auto & e: v)
#define until(e) while(! (e))
#define if_not(e) if(! (e))
#define ef else if
#define UR assert(false)

// ---- ----

struct K {
	LL a, b, c, x, y, z, v;
	void A(LL n) { v += n * x; b -= n; c -= n; }
	void B(LL n) { v += n * y; a -= n; c -= n; }
	void C(LL n) { v += n * z; a -= n; b -= n; }
	void minAC() { if(x < z) { A(1); } else { C(1); } }
	bool ok() { return (min({ a, b, c }) > 0); }
	bool is_kado() { assert(a != c); return ((a < b && b > c) || (a > b && b < c)); }
	
	void step1() { if(a == c) { minAC(); } }
	void step2() { if_not(a < c) { swap(a, c); swap(x, z); } }
	void top() {
		assert(a < c && c + 1 > b);
		B(c + 1 - b);
		assert(is_kado());
	}
	void bot() {
		if(b + 1 > a) { A(b + 1 - a); }
		if(b + 1 > c) { C(b + 1 - c); }
		if(a == c) { minAC(); }
		assert(is_kado());
	}
};

LL f(K k) {
	k.step1();
	if(! k.ok()) { return -1; }
	if(k.is_kado()) { return k.v; }
	
	LL INF = 4'000'000'000'000'000'000, ans = INF;
	k.step2();
	K k1 = k; k1.top();
	K k2 = k; k2.bot();
	if(k1.ok()) { setmin(ans, k1.v); }
	if(k2.ok()) { setmin(ans, k2.v); }
	if(ans == INF) { return -1; }
	
	return ans;
}

int main() {
	int n;
	cin >> n;
	inc(i, n) {
		K k;
		cin >> k.a >> k.b >> k.c >> k.z >> k.x >> k.y;
		k.v = 0;
		cout << f(k) << "\n";
	}
	
	return 0;
}