#include <stdio.h>
#include <string>
#include <cstring>
#include <stdlib.h>
#include <math.h>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <list>
#include <iterator>
#include <assert.h>
#pragma warning(disable:4996) 
 
typedef long long ll;
#define MIN(a, b) ((a)>(b)? (b): (a))
#define MAX(a, b) ((a)<(b)? (b): (a))
#define LINF 9223300000000000000
#define INF 2140000000
const long long MOD = 1000000007;
//const long long MOD = 998244353;

using namespace std;


int main(int argc, char* argv[])
{
    int T;
    scanf("%d", &T);
    int t;
    for(t=0; t<T; t++) {
        ll a,b,c,x,y,z;
        scanf("%lld%lld%lld%lld%lld%lld", &a, &b, &c, &x, &y, &z);

        ll ans=LINF;
        {
            ll cnt=0;
            ll a0=a, b0=b, c0=c;
            if(a0>=b0) {
                cnt+=(a0-b0+1)*x;
                a0-=(a0-b0+1);
            }
            if(c0>=b0) {
                cnt+=(c0-b0+1)*z;
                c0-=(c0-b0+1);
            }
            if(a0==c0) {
                a0--;
                cnt+=MIN(x,z);
            }
            if(a0>0 && b0>0 && c0>0) {
                ans=MIN(ans,cnt);
            }
        }
        {
            ll cnt=0;
            ll a0=a, b0=b, c0=c;
            if(a0==c0) {
                a0--;
                cnt+=MIN(x,z);
            }
            ll tmp=MIN(a0,c0);
            if(b0>=tmp) {
                cnt+=(b0-tmp+1)*y;
                b0-=(b0-tmp+1);
            }
            if(a0>0 && b0>0 && c0>0) {
                ans=MIN(ans,cnt);
            }
        }
        if(ans==LINF) {
            printf("-1\n");
        }
        else {
            printf("%lld\n", ans);
        }
    }

    return 0;
}