// #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; cin >> A >> B >> C;
    ll x, y, z; cin >> x >> y >> z;
    auto cost = [&](ll t, ll c, ll x) {
        return abs(t - c) * x;
    };
    auto cost_sum = [&](ll t) {
        return cost(t, A, x) + cost(t, B, y) + cost(t, C, z);
    };

    // for(int i=0; i<10; i++) {
    //     fprintf(stderr, "debug: cost_sum(%d) = %lld\n", i, cost_sum(i));
    // }

    ll ub = 100010, lb = -1;
    while(ub - lb > 1) {
        ll m1 = (ub + lb) / 2;
        ll m2 = m1 + 1;
        ll cost_sum_1 = cost_sum(m1);
        ll cost_sum_2 = cost_sum(m2);
        if (cost_sum_1 < cost_sum_2) {
            ub = m1;
        } else {
            lb = m1;
        }
    }
    // fprintf(stderr, "debug: lb = %lld\n", lb);
    ll ans = min(cost_sum(lb), cost_sum(ub));
    cout << ans << endl;
}

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