#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#include <time.h>
#include <stack>
#include <array>
#define popcount __builtin_popcount
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;

int main()
{
	int t;
	cin>>t;
	const ll INF=3e18;
	for(int i=0; i<t; i++){
		ll a, b, c, x, y, z;
		cin>>a>>b>>c>>x>>y>>z;
		if(a>c) swap(a, c), swap(x, z);
		if((a<b && b>c && a!=c) || (a>b && b<c && a!=c)){
			cout<<0<<endl;
			continue;
		}
		ll p=INF, q=INF;
		if(a<b){
			if(b<=c){
				if(a!=b-1) p=z*(c-b+1);
				else if(a>=2) p=min(z*(c-b+2), z*(c-b+1)+x);
			}else{
				if(a!=c) p=0;
				else if(a>=2) p=min(x, z);
			}
		}else if(a==b){
			if(a>=3) p=z*(c-a)+min(2*x+z, 2*z+x);
		}else{
			if(b>=3) p=x*(a-b+1)+z*(c-b+1)+min(x, z);
		}
		if(a<b){
			if(a!=c){
				if(a>=2) q=y*(b-a+1);
			}else{
				if(a>=3) q=y*(b-a+2)+min(x, z);
			}
		}else if(a>b){
			if(a!=c) q=0;
			else{
				if(a-b>=2) q=min(x, z);
				else if(b>=2) q=y+min(x, z);
			}
		}else{
			if(b!=c){
				if(a>=2) q=y;
			}else{
				if(b>=3) q=2*y+min(x, z);
			}
		}
		ll ans=min(p, q);
		if(ans==INF) cout<<-1<<endl;
		else cout<<ans<<endl;
	}
	return 0;
}