#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
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; }

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int t; cin >> t;
	while (t--) {
		long long a, b, c; cin >> a >> b >> c;
		long long x, y, z; cin >> x >> y >> z;
		long long ans = LINF;
		{//021
			long long ca = a, cb = b, cc = c;
			cb = cb;
			cc = min(cc, cb - 1);
			ca = min(ca, cc - 1);
			//cout << ca << " " << cb << " " << cc << endl;
			long long val = abs(ca - a)*x + abs(cb - b) * y + abs(cc - c) *z;
			if (ca > 0 && cb > 0 && cc > 0)chmin(ans, val);
		}
		{//120

			long long ca = a, cb = b, cc = c;
			cb = cb;
			ca = min(ca, cb - 1);
			cc = min(cc, ca - 1);
			//cout << ca << " " << cb << " " << cc << endl;
			long long val = abs(ca - a)*x + abs(cb - b) * y + abs(cc - c) *z;
			if (ca > 0 && cb > 0 && cc > 0)chmin(ans, val);
		}
		{//102
			long long ca = a, cb = b, cc = c;
			cc = cc;
			ca = min(ca, cc - 1);
			cb = min(cb, ca - 1);
			//cout << ca << " " << cb << " " << cc << endl;
			long long val = abs(ca - a)*x + abs(cb - b) * y + abs(cc - c) *z;
			if (ca > 0 && cb > 0 && cc > 0)chmin(ans, val);
		}
		{//201
			long long ca = a, cb = b, cc = c;
			ca = ca;
			cc = min(cc, ca - 1);
			cb = min(cb, cc - 1);
			//cout << ca << " " << cb << " " << cc << endl;
			long long val = abs(ca - a)*x + abs(cb - b) * y + abs(cc - c) *z;
			if (ca > 0 && cb > 0 && cc > 0)chmin(ans, val);
		}
		if (LINF == ans)ans = -1;
		cout << ans << endl;
	}
	return 0;
}