// #define _GLIBCXX_DEBUG // for STL debug (optional)
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>
#include <climits>
#include <ctime>
#include <cassert>
#include <numeric>
#include <fstream>
#include <functional>
#include <bitset>
using namespace std;
using ll = long long int;
using int64 = long long int;
 
template<typename T> void chmax(T &a, T b) {a = max(a, b);}
template<typename T> void chmin(T &a, T b) {a = min(a, b);}
template<typename T> void chadd(T &a, T b) {a = a + b;}
 
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
const int INF = 1LL << 29;
const ll LONGINF = 1LL << 60;
const ll MOD = 1000000007LL;

void solve() {
    ll a, b, c, x, y, z; cin >> a >> b >> c >> x >> y >> z;
    ll res = LONGINF;

    {
        ll A = a, B = b, C = c;
        ll ans = 0;
        if(A >= B) ans += (A - (B - 1)) * x, A = B - 1;
        if(C >= B) ans += (C - (B - 1)) * z, C = B - 1;
        if(A == C) {
            if(x > z) C--, ans += z;
            else A--, ans += x;
        }
        
        bool ok = true;
        ok &= (A > 0 and B > 0 and C > 0);
        ok &= (A != B);
        ok &= (B != C);
        ok &= (C != A);
        if(ok) chmin(res, ans);
    }

    {
        ll A = a, B = b, C = c;
        ll ans = 0;
        if(A == C) {
            if(x > z) C--, ans += z;
            else A--, ans += x;
        }

        ll target = min(min(A, C) - 1, B);
        ans += (B - target) * y;
        B = target;

        bool ok = true;
        ok &= (A > 0 and B > 0 and C > 0);
        ok &= (A != B);
        ok &= (B != C);
        ok &= (C != A);
        if(ok) chmin(res, ans);
    }

    if(res == LONGINF) cout << -1 << endl;
    else cout << res << endl;
}

int main() {
    int T; cin >> T;
    while(T--) solve();
    return 0;
}