//#include <tourist>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p;
const int INF = 1e9;
const ll LINF = ll(1e18) + 1;
const int MOD = 1000000007;
const int dx[4] = {0, 1, 0, -1}, dy[4] = {-1, 0, 1, 0};
const int Dx[8] = {0, 1, 1, 1, 0, -1, -1, -1}, Dy[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
#define yes cout << "Yes" << endl
#define YES cout << "YES" << endl
#define no cout << "No" << endl
#define NO cout << "NO" << endl
#define rep(i, n) for (int i = 0; i < n; i++)
#define ALL(v) v.begin(), v.end()
#define debug(v)          \
    cout << #v << ":";    \
    for (auto x : v)      \
    {                     \
        cout << x << ' '; \
    }                     \
    cout << endl;
template <class T>
bool chmax(T &a, const T &b)
{
    if (a < b)
    {
        a = b;
        return 1;
    }
    return 0;
}
template <class T>
bool chmin(T &a, const T &b)
{
    if (b < a)
    {
        a = b;
        return 1;
    }
    return 0;
}
//cout<<fixed<<setprecision(15);有効数字15桁
//-std=c++14
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int t;
vector<ll> ans;
int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    cin >> t;
    int copy=t;
    while(copy--){
        ll a,b,c,x,y,z,a1,b1,c1;
        cin>>a>>b>>c>>x>>y>>z;
        vector<ll> xyz={x,y,z};
        vector<int> d(3);
        d[0]=0;
        d[1]=1;
        d[2]=2;
        ll res=LINF;
        do{
            if(d[1]==1)continue;
            ll cost=0;
            vector<ll> abc={a,b,c};
            ll prev=abc[d[0]];
            for(int i=1;i<3;i++){
                ll next=min(prev-1,abc[d[i]]);
                cost+=(abc[d[i]]-next)*xyz[d[i]];
                prev=next;
            }
            if(prev>0) chmin(res,cost);
        }while(next_permutation(ALL(d)));
        if(res==LINF)ans.push_back(-1);
        else ans.push_back(res);
    }
    rep(i,t)
    cout << ans[i] << "\n";
}