#pragma comment (linker, "/STACK:256000000")
#define  _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <cstring>
#include <queue>
#include <stack>
#include <math.h>
#include <iterator>
#include <vector>
#include <string>
#include <set>
#include <math.h>
#include <iostream>
#include <random>
#include<map>
#include <iomanip>
#include <time.h>
#include <stdlib.h>
#include <list>
#include <typeinfo>
#include <list>
#include <set>
#include <cassert>
#include<fstream>
#include <unordered_map>
#include <unordered_set>
#include <cstdlib>
#include <complex>
#include <cctype>
#include <bitset>

using namespace std;
typedef string::const_iterator State;
const long double Ma_PI = 3.1415926535897932384626433832795028841971L;
#define eps 1e-15L
#define LONG_INF 2000000000000000000LL
#define GOLD 1.61803398874989484820458
#define MAX_MOD 1000000007LL
#define GYAKU 500000004LL

#define MOD 998244353LL
#define seg_size 262144*2
#define pb push_back
#define mp make_pair
typedef long long ll;
#define REP(a,b) for(long long a = 0;a < b;++a)
#define ALL(x) (x).begin(),(x).end()
void init() {
    iostream::sync_with_stdio(false);
    cout << fixed << setprecision(100);
}
unsigned long xor128() {
    static unsigned long x = 123456789, y = 362436069, z = 521288629, w = 88675123;
    unsigned long t = (x ^ (x << 11));
    x = y; y = z; z = w;
    return (w = (w ^ (w >> 19)) ^ (t ^ (t >> 8)));
}
typedef struct BigInt {
    string s = "0";
    BigInt operator +(BigInt obj) {
        string c;
        while (max(obj.s.length(), this->s.length()) + 1 > c.length()) {
            c.pb('0');
        }
        for (int q = 0; q < obj.s.length(); ++q) {
            c[c.length() - 1 - q] = obj.s[obj.s.length() - q - 1];
        }
        for (int q = 0; q < this->s.length(); ++q) {
            c[c.length() - 1 - q] += this->s[this->s.length() - 1 - q] - '0';
            if (c[c.length() - 1 - q] > '9') {
                c[c.length() - 2 - q]++;
                c[c.length() - 1 - q] -= 10;
            }
        }
        if (c.front() == '0') {
            c.erase(c.begin());
        }
        return BigInt{ c };
    }
    BigInt operator *(BigInt obj) {
        BigInt ans;
        for (int i = this->s.length() - 1; i >= 0; --i) {
            REP(q, this -> s[i] - '0') {
                ans = ans + obj;
            }
            obj.s.pb('0');
        }
        return ans;
    }
}BigInt;

#define int ll
void solve() {
    vector<int> inputs;
    vector<int> costs;
    REP(q, 3) {
        int a;
        cin >> a;
        inputs.pb(a);
    }
    REP(q, 3) {
        int a;
        cin >> a;
        costs.pb(a);
    }
    if (inputs[0] > inputs[2]||(inputs[0] == inputs[2]&&costs[0] > costs[1])) {
        swap(inputs[0], inputs[2]);
        swap(costs[0], costs[1]);
    }
    int ans = 0;
    if (inputs[0] == inputs[2]) {
        //take one X
        inputs[0]--;
        inputs[1]--;
        ans += costs[0];
        if (inputs[0] <= 0||inputs[1] <= 0) {
            cout << -1 << endl;
            return;
        }
    }
    if (inputs[0] != inputs[1] && inputs[1] != inputs[2] && inputs[0] != inputs[2]) {
        if (inputs[1] < min(inputs[0], inputs[2]) || inputs[1] > max(inputs[0], inputs[2])) {
            cout << ans << endl;
            return;
        }
    }
    //inputs[0] <= inputs[1] <= inputs[2]
    ll pre_ans = 5e18;
    {
        vector<int> tmp = inputs;
        int depth = tmp[2] - tmp[1] + 1;
        tmp[0] -= depth;
        tmp[2] -= depth;
        if (tmp[0] >= 1 && tmp[2] >= 1) {
            pre_ans = min(pre_ans, depth * costs[2]);
        }
    }
    {
        vector<int> tmp = inputs;
        int depth = tmp[1] - tmp[0] + 1;
        tmp[1] -= depth;
        tmp[2] -= depth;
        int cost = costs[1] * depth;
        if (tmp[0] == tmp[2]) {
            tmp[1]--;
            int now_cost = 5e18;
            if (tmp[2] - 1 >= 1) {
                now_cost = min(now_cost, costs[1]);
            }
            if (tmp[0] - 1 >= 1) {
                now_cost = min(now_cost, costs[0]);
            }
            cost += now_cost;
        }
        if (tmp[0] >= 1 && tmp[2] >= 1&&tmp[1] >= 1) {
            pre_ans = min(pre_ans, cost);
        }
    }
    if (pre_ans == 5e18) {
        ans = -1;
    }
    else {
        ans += pre_ans;
    }
    cout << ans << endl;
}

#undef int
int main() {
    init();
    int t;
    cin >> t;
    REP(tea,t)
    solve();
}