#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;
bool check(ll a, ll b, ll c){
	if(a<=0 || b<=0 || c<=0) return false;
	if((a<b && b>c && a!=c) || (a>b && b<c && a!=c)) return true;
	else return false;
}
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(check(a, b, c)){
			cout<<0<<endl;
			continue;
		}
		ll ans=INF;
		for(int i=0; i<5; i++){
			for(int j=0; j<5; j++){
				ll a1=a-i, b1=b-i-j, c1=c-j;
				if(a1<=0 || b1<=0 || c1<=0 || a1==c1) continue;
				if(check(a1, b1, c1)){
					ans=min(ans, x*i+y*j);
					continue;
				}
				for(int k=0; k<5; k++){
					ll l=a1-b1+1+k;
					if(l<0) continue;
					if(check(a1-l, b1, c1-l)) ans=min(ans, x*i+y*j+z*l);
				}
				for(int k=0; k<5; k++){
					ll l=c1-b1+1+k;
					if(l<0) continue;
					if(check(a1-l, b1, c1-l)) ans=min(ans, x*i+y*j+z*l);
				}
			}
		}
		for(int i=0; i<5; i++){
			for(int j=0; j<5; j++){
				ll a1=a-j, b1=b-i, c1=c-i-j;
				if(a1<=0 || b1<=0 || c1<=0 || a1==b1) continue;
				if(check(a1, b1, c1)){
					ans=min(ans, y*i+z*j);
					continue;
				}
				for(int k=0; k<5; k++){
					ll l=b1-c1+1+k;
					if(l<0) continue;
					if(check(a1-l, b1-l, c1)) ans=min(ans, y*i+z*j+x*l);
				}
			}
		}
		for(int i=0; i<5; i++){
			for(int j=0; j<5; j++){
				ll a1=a-i-j, b1=b-j, c1=c-i;
				if(a1<=0 || b1<=0 || c1<=0 || b1==c1) continue;
				if(check(a1, b1, c1)){
					ans=min(ans, z*i+x*j);
					continue;
				}
				for(int k=0; k<5; k++){
					ll l=b1-a1+1+k;
					if(l<0) continue;
					if(check(a1, b1-l, c1-l)) ans=min(ans, z*i+x*j+y*l);
				}
			}
		}
		if(ans==INF) cout<<-1<<endl;
		else cout<<ans<<endl;
	}
	return 0;
}