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

#undef _P
#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 ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
//-------------------------------------------------------

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

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>T;
	while(T--) {
		cin>>A>>B>>C>>X>>Y>>Z;
		
		ll mi=1LL<<60;
		
		// B->C->A
		{
			ll TB=B;
			ll TC=min(TB-1,C);
			ll TA=min(TC-1,A);
			if(TA>0 && TB>0 && TC>0) mi=min(mi,(A-TA)*X+(B-TB)*Y+(C-TC)*Z);
		}
		// B->A->C
		{
			ll TB=B;
			ll TA=min(TB-1,A);
			ll TC=min(TA-1,C);
			if(TA>0 && TB>0 && TC>0) mi=min(mi,(A-TA)*X+(B-TB)*Y+(C-TC)*Z);
		}
		// C->A->B
		{
			ll TC=C;
			ll TA=min(TC-1,A);
			ll TB=min(TA-1,B);
			if(TA>0 && TB>0 && TC>0) mi=min(mi,(A-TA)*X+(B-TB)*Y+(C-TC)*Z);
		}
		// A->C->B
		{
			ll TA=A;
			ll TC=min(TA-1,C);
			ll TB=min(TC-1,B);
			if(TA>0 && TB>0 && TC>0) mi=min(mi,(A-TA)*X+(B-TB)*Y+(C-TC)*Z);
		}
		
		
		if(mi==1LL<<60) mi=-1;
		cout<<mi<<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;
}