#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <string>
#include <map>
#include <set>
#include <stack>
#include <tuple>
#include <deque>
#include <array>
#include <numeric>
#include <bitset>
#include <iomanip>
#include <cassert>
#include <chrono>
#include <random>
#include <limits>
#include <iterator>
#include <functional>
#include <sstream>
#include <fstream>
#include <complex>
#include <cstring>
#include <unordered_map>
using namespace std;

using ll = long long;
using P = pair<int, int>;
constexpr int INF = 1001001001;
// constexpr int mod = 1000000007;
constexpr int mod = 998244353;

template<class T>
inline bool chmax(T& x, T y){
    if(x < y){
        x = y;
        return true;
    }
    return false;
}
template<class T>
inline bool chmin(T& x, T y){
    if(x > y){
        x = y;
        return true;
    }
    return false;
}

constexpr ll inf = 4e+18;

ll func(ll a, ll b, ll c, ll x, ll y, ll z){
    ll res = 0;
    if(b >= c){
        res += (b - (c - 1)) * y;
        b = c - 1;
    }
    if(a >= b){
        res += (a - (b - 1)) * x;
        a = b - 1;
    }
    return a > 0 ? res : inf;
}

void solve(){
    ll A, B, C, X, Y, Z;
    cin >> A >> B >> C >> X >> Y >> Z;

    ll ans = inf;
    
    // (B, A, C)
    chmin(ans, func(B, A, C, Y, X, Z));

    // (B, C, A)
    chmin(ans, func(B, C, A, Y, Z, X));

    // (A, C, B)
    chmin(ans, func(A, C, B, X, Z, Y));

    // (C, A, B)
    chmin(ans, func(C, A, B, Z, X, Y));

    if(ans == inf)  ans = -1;
    cout << ans << '\n';
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int T;
    cin >> T;
    while(T--)  solve();

    return 0;
}