#include <bits/stdc++.h>

using namespace std;

typedef pair<int, int> pii;
typedef long long ll;
const int N = 2000086, MOD = 998244353, INF = 0x3f3f3f3f;
int n, m, w[N];

pii a[N];
int main() {
    int T;
    cin >> T;
    while (T--) {
        n = 3;
        for (int i = 1; i < n + 1; i++) scanf("%d", &a[i].first);
        for (int i = 1; i < n + 1; i++) scanf("%d", &a[i].second);
        sort(a + 1, a + n + 1);
        if (a[1].second + a[2].second < a[3].second) printf("%lld\n", (ll)(a[3].first - a[1].first) * a[1].second + (ll)(a[3].first - a[2].first) * a[2].second);
        else if (a[1].second > a[2].second + a[3].second) printf("%lld\n", (ll)(a[3].first - a[1].first) * a[3].second + (ll)(a[2].first - a[1].first) * a[2].second);
        else printf("%lld\n", (ll)(a[3].first - a[2].first) * a[3].second + (ll)(a[2].first - a[1].first) * a[1].second);
    }
    return 0;
}