#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, s, e) for (int i = (int)(s); i < (int)(e); ++i)

int main() {
	cin.tie(nullptr);
	ios_base::sync_with_stdio(false);
	
	int T;
	cin >> T;
	
	rep(test, 0, T) {
		vector<pair<ll, ll>> A(3);
		rep(i, 0, 3) cin >> A[i].first;
		rep(i, 0, 3) cin >> A[i].second;
		
		sort (A.begin(), A.end());
		
		ll sum = 0;
		rep(i, 0, 3) sum += A[i].second;
		
		ll w;
		if (A[0].second >= sum/2 + 1) w = A[0].first;
		else if (A[0].second + A[1].second >= sum/2 + 1) w = A[1].first;
		else w = A[2].first;
		
		ll ans = 0;
		rep(i, 0, 3) ans += A[i].second * abs(A[i].first - w);
		cout << ans << '\n';
	}
}