#include <bits/stdc++.h>
using namespace std;
#define REP(i,a,n) for(int i=(a); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define FOR(it,c) for(__typeof((c).begin()) it=(c).begin(); it!=(c).end(); ++it)
#define ALLOF(c) (c).begin(), (c).end()
typedef long long ll;
typedef unsigned long long ull;

const static ll INF = (ll)(1e19);

bool isKadomatsu(int A, int B, int C){
  map<int,int> m;
  m[A] = 1;
  m[B] = 1;
  m[C] = 1;
  if(m.size() != 3) return false;
  vector<int> v{A,B,C};
  sort(ALLOF(v));
  return (v[1]==A || v[1]==C);
}

ll check(int A, int B, int C, int tA, int tB, int tC, int X, int Y, int Z){
  if(!isKadomatsu(tA, tB, tC)) return INF;

  ll dA = tA-A;
  ll dB = tB-B;
  ll dC = tC-C;

  if(dA+dC >= B) return INF;
  if(dA+dB >= C) return INF;
  if(dB+dC >= A) return INF;

  
  ll ret = 0;
  ret += dA * (ll)Y;
  ret += dB * (ll)Z;
  ret += dC * (ll)X;

  //cout << tA << " " << tB << " " << tC << "  " << ret << endl;
  
  return ret;
}

ll solve(int A, int B, int C, int X, int Y, int Z){
  map<int,int> cand;
  for(int i=-2; i<=2; i++) if(A+i>0) cand[A+i] = 1;
  for(int i=-2; i<=2; i++) if(B+i>0) cand[B+i] = 1;
  for(int i=-2; i<=2; i++) if(C+i>0) cand[C+i] = 1;
  vector<int> v;
  FOR(it,cand) v.push_back(it->first);

  ll ret = INF;
  rep(i,v.size()){
    if(A>v[i]) continue;
    rep(j,v.size()){
      if(B>v[j]) continue;
      rep(k,v.size()){
        if(C>v[k]) continue;
        ret = min(ret, check(A,B,C,v[i],v[j],v[k],X,Y,Z));
      }
    }
  }
  
  if(ret == INF) return -1;
  return ret;
}

int main(){
  int T;
  cin >> T;

  rep(t,T){
    int A, B, C, X, Y, Z;
    cin >> A >> B >> C >> X >> Y >> Z;
    cout << solve(A, B, C, X, Y, Z) << endl;
  }
  
  return 0;
}