#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
const ll INF = 1e18;
const int MOD = 1000000007;

ll order(ll p,ll q,ll r,ll x,ll y,ll z){
        if(p < q && q < r) return 0;
        ll res = 0;
        if(q >= r){
                res += y*(q-r+1);
                q = r-1;
        }
        if(p >= q){
                res += x*(p-q+1);
                p = q-1;
        }
        if(p <= 0 || q <= 0 || r <= 0) res += INF;
        return res;
}


int main(){
        int t;
        cin >> t;
        while(t--){
                ll  a,b,c,x,y,z;
                cin >> a >> b >> c >> x >> y >> z;
                ll res = INF;
                res = min(res,order(a,c,b,x,z,y));
                res = min(res,order(c,a,b,z,x,y));
                res = min(res,order(b,a,c,y,x,z));
                res = min(res,order(b,c,a,y,z,x));
                if(res == INF) cout << -1 << endl;
                else cout << res << endl;
        }
        return 0;
}