#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) begin(v),end(v)
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
using ll = long long;
using pii = pair<int, int>;
constexpr ll INF = 1ll<<30;
constexpr ll longINF = 1ll<<60;
constexpr ll MOD = 1000000007;
constexpr bool debug = false;
//---------------------------------//

int main() {
	int T;
	cin >> T;
	while (T--) {
		int A, B, C, X, Y, Z;
		scanf("%d %d %d %d %d %d", &A, &B, &C, &X, &Y, &Z);
		ll ans = longINF;
		auto func = [](int a, int b, int c, int x, int y, int z) {
			ll res = 0;
			const int v[] {a, b, c}, cost[] {x, y, z};
			int prv = INF;
			REP(i, 3) {
				int cur = min(prv - 1, v[i]);
				if (cur <= 0) return longINF;
				res += (ll)(v[i] - cur) * cost[i];
				prv = cur;
			}
			return res;
		};
		chmin(ans, func(B, A, C, Y, X, Z));
		chmin(ans, func(B, C, A, Y, Z, A));
		chmin(ans, func(A, C, B, X, Z, Y));
		chmin(ans, func(C, A, B, Z, X, Y));
		if (ans == longINF) puts("-1");
		else printf("%lld\n", ans);
	}
}