#include <bits/stdc++.h>
using namespace std;
#define modulo 1000000007
#define mod(mod_x) ((((long long)mod_x+modulo))%modulo)
#define Inf 1000000000000000000



int main(){
	
	int T;
	cin>>T;
	
	for(int i=0;i<T;i++){
		long long A,B,C;
		long long X,Y,Z;
		cin>>A>>B>>C>>X>>Y>>Z;
		long long ans = Inf;
		if(A>B&&C>B){
			if(A==C){
				if(B+1==A){
					if(B==1)ans = -1;
					else{
						ans = min(X,Z)+Y;
						ans = min (ans,min(X,Z)*2);
					}
				}
				else{
					ans = min(X,Z);
				}
				
			}
			else{
				ans = 0;
			}
			cout<<ans<<endl;
			continue;
		}
		if(A<B&&C<B){
			if(A==C){
				if(A==1)ans = -1;
				else ans = min(X,Z);
			}
			else{
				ans = 0;
			}
			cout<<ans<<endl;
			continue;
		}
		if(A>C){
			swap(A,C);
			swap(X,Z);
		}
		
		int x = 0;
		if(A==B&&B==C){
			if(A<=2)ans = -1;
			else{
				ans = Y*2 + min(X,Z);
				ans = min(ans,max(X,Z)+min(X,Z)*2);
			}
		}
		else if(A==B){
			if(A==1)ans = -1;
			else{
				ans = Y;
				if(A>2)ans = min(ans,X + Z*(C-B+1) + min(X,Z));
			}
		}
		else if(B==C){
			if(B==1)ans = -1;
			else{
				if(A+1!=B)ans = Z;
				else{
					if(A==1)ans = -1;
					else{
						ans = Y*2;
						ans = min(Z*2,ans);
					}
	
				}
				if(A!=1){
					ans = min(ans,(B-A+1)*Y);
				}
			}
		}
		else{
			ans = Inf;
			if(A!=1)ans = min(ans,(B-A+1)*Y);
			if(B-A!=1)ans = min(ans,(C-B+1)*Z);
			else if(A!=1)ans = min(ans,(C-A+1)*Z);
			if(ans==Inf)ans = -1;
		}
		if(ans==Inf)ans = -1;
		cout<<ans<<endl;
	}

	return 0;
}