#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <algorithm>
#include <iomanip>
#include <numeric>
using namespace std;
using ll = long long;
void solve() {
	int N = 3;
	vector<ll> A(N), X(N);
	for (int i = 0;i < N;i++) cin >> A[i];
	for (int i = 0;i < N;i++) cin >> X[i];
	ll res = (1LL << 60);
	for (int i = 0;i < N;i++) {
		ll sc = 0;
		for (int j = 0;j < N;j++) sc += X[j] * abs(A[i]-A[j]);
		res = min(res, sc);
	}	
	cout << res << endl;
}
int main() {
	int t;cin >> t;
	while (t--) solve();
}