#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
template<class T> bool chmax(T &a, const T &b) { if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------

int T;
ll A,B,C,X,Y,Z,W;

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>T;
	while(T--) {
		cin>>A>>B>>C;
		cin>>X>>Y>>Z>>W;
		ll ret=0;
		for(i=0;i<=min(A,B);i++) {
			ll sum=X*i;
			ll a=A-i;
			ll b=B-i;
			ll c=C;
			if(W>=Y&&W>=Z) {
				x=min({a,b,c});
				sum+=x*W;
				a-=x;
				b-=x;
				c-=x;
			}
			if(Y>=Z) {
				x=min(b,c);
				sum+=x*Y;
				b-=x;
				c-=x;
				x=min(a,c);
				sum+=x*Z;
				b-=x;
				c-=x;
			}
			else {
				x=min(a,c);
				sum+=x*Z;
				b-=x;
				c-=x;
				x=min(b,c);
				sum+=x*Y;
				b-=x;
				c-=x;
			}
			ret=max(ret,sum);
		}
		for(i=0;i<=min(A,B);i++) {
			ll sum=X*i;
			ll c=C;
			ll a=min(A-i,c);
			ll b=min(B-i,c);
			if(a+b>c) {
				ll w=a+b-c;
				sum+=w*W+(a-w)*Z+(b-w)*Y;
				ret=max(ret,sum);
			}
		}
		cout<<ret<<endl;
	}
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}