#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
 
#define ALL(obj) (obj).begin(),(obj).end()
#define SPEED cin.tie(0);ios::sync_with_stdio(false);
 
template<class T> using PQ = priority_queue<T>;
template<class T> using PQR = priority_queue<T,vector<T>,greater<T>>;
 
constexpr long long MOD = (long long)1e9 + 7;
constexpr long long MOD2 = 998244353;
constexpr long long HIGHINF = (long long)1e18;
constexpr long long LOWINF = (long long)1e15;
constexpr long double PI = 3.1415926535897932384626433;
 
template <class T> vector<T> multivector(size_t N,T init){return vector<T>(N,init);}
template <class... T> auto multivector(size_t N,T... t){return vector<decltype(multivector(t...))>(N,multivector(t...));}
template <class T> void corner(bool flg, T hoge) {if (flg) {cout << hoge << endl; exit(0);}}
template <class T, class U>ostream &operator<<(ostream &o, const map<T, U>&obj) {o << "{"; for (auto &x : obj) o << " {" << x.first << " : " << x.second << "}" << ","; o << " }"; return o;}
template <class T>ostream &operator<<(ostream &o, const set<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const multiset<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const vector<T>&obj) {o << "{"; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? ", " : "") << obj[i]; o << "}"; return o;}
template <class T, class U>ostream &operator<<(ostream &o, const pair<T, U>&obj) {o << "{" << obj.first << ", " << obj.second << "}"; return o;}
void print(void) {cout << endl;}
template <class Head> void print(Head&& head) {cout << head;print();}
template <class Head, class... Tail> void print(Head&& head, Tail&&... tail) {cout << head << " ";print(forward<Tail>(tail)...);}
template <class T> void chmax(T& a, const T b){a=max(a,b);}
template <class T> void chmin(T& a, const T b){a=min(a,b);}
void YN(bool flg) {cout << (flg ? "YES" : "NO") << endl;}
void Yn(bool flg) {cout << (flg ? "Yes" : "No") << endl;}
void yn(bool flg) {cout << (flg ? "yes" : "no") << endl;}

int main() {
	int T; cin >> T;
	while (T--){
		ll A,B,C,D,E,F; cin >> A >> B >> C >> D >> E >> F;
		ll ans = LOWINF;
		for(int i = 0; i < 7; ++i){
			for(int j = 0; j < 7; ++j){
				for(int k = 0; k < 7; ++k){
					ll X=0,Y=0,Z=0,cnt=0;
					if(i==0) X = A;
					if(i==1 && A>=A-1) X = A-1,cnt+=(A-A+1)*D;
					if(i==2 && A>=A-2) X = A-2,cnt+=(A-A+2)*D;
					if(i==3 && A>=B-1) X = B-1,cnt+=(A-B+1)*D; 
					if(i==4 && A>=B-2) X = B-2,cnt+=(A-B+2)*D; 
					if(i==5 && A>=C-1) X = C-1,cnt+=(A-C+1)*D; 
					if(i==6 && A>=C-2) X = C-2,cnt+=(A-C+2)*D; 
					if(j==0) Y = B;
					if(j==1 && B>=A-1) Y = A-1,cnt+=(B-A+1)*E;
					if(j==2 && B>=A-2) Y = A-2,cnt+=(B-A+2)*E;
					if(j==3 && B>=B-1) Y = B-1,cnt+=(B-B+1)*E; 
					if(j==4 && B>=B-2) Y = B-2,cnt+=(B-B+2)*E; 
					if(j==5 && B>=C-1) Y = C-1,cnt+=(B-C+1)*E; 
					if(j==6 && B>=C-2) Y = C-2,cnt+=(B-C+2)*E; 
					if(k==0) Z = C;
					if(k==1 && C>=A-1) Z = A-1,cnt+=(C-A+1)*F;
					if(k==2 && C>=A-2) Z = A-2,cnt+=(C-A+2)*F;
					if(k==3 && C>=B-1) Z = B-1,cnt+=(C-B+1)*F; 
					if(k==4 && C>=B-2) Z = B-2,cnt+=(C-B+2)*F; 
					if(k==5 && C>=C-1) Z = C-1,cnt+=(C-C+1)*F; 
					if(k==6 && C>=C-2) Z = C-2,cnt+=(C-C+2)*F; 
					if(X>0&&Y>0&&Z>0&&X!=Y&&Y!=Z&&Z!=X&&((Y<X&&Y<Z)||(X<Y&&Z<Y))) chmin(ans,cnt); 
				}
			}
		}
		if(ans==LOWINF) ans = -1;
		cout << ans << endl;
	}
	
	
    return 0;
}