#include <bits/stdc++.h>
#define rep(i,n) for(int i=(0);i<(n);i++)

using namespace std;

typedef long long ll;

ll solve(ll a, ll b, ll c, ll x, ll y, ll z){
	ll INF = 2 * 1e18;

	ll ret = INF;
	// 132
	if(a >= 1 && b >= 3 && c >= 2){
		ll u = min(c, b - 1);
		ll t = (c - u) * z;
		u = min(a, u - 1);
		t += (a - u) * x;
		ret = min(ret, t);
	}

	// 213
	if(a >= 2 && b >= 1 && c >= 3){
		ll u = min(a, c - 1);
		ll t = (a - u) * x;
		u = min(b, u - 1);
		t += (b - u) * y;
		ret = min(ret, t);
	}

	// 231
	if(a >= 2 && b >= 3 && c >= 1){
		ll u = min(a, b - 1);
		ll t = (a - u) * x;
		u = min(c, u - 1);
		t += (c - u) * z;
		ret = min(ret, t);
	}

	// 312
	if(a >= 3 && b >= 1 && c >= 2){
		ll u = min(c, a - 1);
		ll t = (c - u) * z;
		u = min(b, u - 1);
		t += (b - u) * y;
		ret = min(ret, t);
	}
	
	if(ret == INF) return -1;
	return ret;
}

int main(){
	cin.tie(0);
	ios::sync_with_stdio(false);
	
	int t;
	cin >> t;

	vector<ll> a(t), b(t), c(t), x(t), y(t), z(t);
	rep(i, t) cin >> a[i] >> b[i] >> c[i] >> x[i] >> y[i] >> z[i];
	rep(i, t) cout << solve(a[i], b[i], c[i], x[i], y[i], z[i]) << "\n";
}