#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
ll ILL=2167167167167167167;
const int INF=2100000000;
const int mod=998244353;
#define rep(i,a,b) for (ll i=a;i<b;i++)
#define all(p) p.begin(),p.end()
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
void yneos(bool a){if(a) cout<<"Yes\n"; else cout<<"No\n";}
template<class T> void vec_out(vector<T> &p){for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}
template<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}
template<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}
template<class T> T vec_sum(vector<T> &a){assert(!a.empty());T ans=a[0]-a[0];for(auto &x:a) ans+=x;return ans;}
int pop_count(long long a){int res=0;while(a){res+=(a&1),a>>=1;}return res;}


ll solve_sub(vector<ll> P,vector<ll> Q);
void solve();
// oddloop
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	
	int t=1;
	cin>>t;
	rep(i,0,t) solve();
}

ll solve_sub(vector<ll> P,vector<ll> Q){
	if(vec_min(P)<0) return -ILL;
	ll res=0;
	rep(rp,0,3){
		rep(i,0,2) swap(P[i],P[i+1]),swap(Q[i],Q[i+1]);
		ll X=0;
		while(vec_min(P)>=X){
			ll tmp=(X/2)*Q[3];
			auto base=P;
			for(auto &x:P) x-=X;
			vector<ll> R={0,P[0],P[1],max(0ll,P[1]-P[2])};
			for(auto x:R){
				if(min(P[0],P[1])<x) continue;
				chmax(res,tmp+Q[0]*x+Q[1]*min(P[2],P[1]-x));
			}
			P=base;
			/*
			if(vec_min(P)==1||vec_min(P)==2){
				vec_out(P);
				vec_out(Q);
				cout<<X<<" "<<res<<endl;
			}*/
			X+=2;
		}
	}
	return res;
}
void solve(){
	vector<ll> p(3),q(4);
	rep(i,0,3) cin>>p[i];
	rep(i,0,4) cin>>q[i];
	ll T=q[3];
	ll S=q[0]+q[1]+q[2];
	ll ans=0;
	q[3]=max(S,T*2);
	rep(i,0,2){
		chmax(ans,solve_sub(p,q)+i*T);
		rep(j,0,3) p[j]--;
	}
	cout<<ans<<"\n";
}