#include <fstream>
#include <bitset>
using namespace std;

ifstream f("portal3.in");
ofstream g("portal3.out");


struct pt {
    int x;
    int y;
};

int t,ti,n,m,c12,c34,c56;
pt p1,p2,p3,p4,p5,p6;
bitset <20> fr;
int d1,d2,d3,d4,d5,d6,d13,d14,d15,d16,d23,d24,d25,d26,d35,d36,d45,d46;

int portal1();
int portal2( );
int portal3( );
int portal4( );
int portal5( );
int portal6( );


int costminim( ) {
    int cost;
    cost=n+m;
    int v;
    d1=p1.x+p1.y;d2=p2.x+p2.y;d3=p3.x+p3.y;d4=p4.x+p4.y;d5=p5.x+p5.y;d6=p6.x+p6.y;
    d13=max(d1,d3)-min(d1,d3);
    d14=max(d1,d4)-min(d1,d4);
    d15=max(d1,d5)-min(d1,d5);
    d16=max(d1,d6)-min(d1,d6);
    d23=max(d2,d3)-min(d2,d3);
    d24=max(d2,d4)-min(d2,d4);
    d25=max(d2,d5)-min(d2,d5);
    d26=max(d2,d6)-min(d2,d6);
    d35=max(d3,d5)-min(d3,d5);
    d36=max(d3,d6)-min(d3,d6);
    d45=max(d4,d5)-min(d4,d5);
    d46=max(d4,d6)-min(d4,d6);

    fr[1]=fr[2]=1;
    v=d1+portal2()+c12+2;
    cost=min(cost,v);
    v=d2+portal1()+c12+2;
    cost=min(cost,v);
    fr[1]=fr[2]=0;

    fr[3]=fr[4]=1;
    v=d3+portal4()+c34+2;
    cost=min(cost,v);
    v=d4+portal3()+c34+2;
    cost=min(cost,v);
    fr[3]=fr[4]=0;

    fr[5]=fr[6]=1;
    v=d5+portal6()+c56+2;
    cost=min(cost,v);
    v=d6+portal5()+c56+2;
    cost=min(cost,v);
    fr[5]=fr[6]=0;

    return cost;
}

int main () {
    f >> t;
    for (ti=1;ti<=t;ti++) {
        f >> n >> m;
        f >> p1.x >> p1.y >> p2.x >> p2.y >> c12;
        f >> p3.x >> p3.y >> p4.x >> p4.y >> c34;
        f >> p5.x >> p5.y >> p6.x >> p6.y >> c56;
        g << costminim() << '\n';
    }
    f.close();g.close();
    return 0;
}



int portal1( ) {
    int cost;
    cost=n+m-d1;
    int v;
    fr[1]=fr[2]=1;
    if (fr[3]==0 && fr[4]==0) {
        v=d13+portal4()+c34;
        cost=min(cost,v);
        v=d14+portal3()+c34;
        cost=min(cost,v);
    }
    if (fr[5]==0 && fr[6]==0) {
        v=d15+portal6()+c56;
        cost=min(cost,v);
        v=d16+portal5()+c56;
        cost=min(cost,v);
    }
    fr[1]=fr[2]=0;
    return cost;
}
int portal2( ) {
    int cost;
    cost=n+m-d2;
    int v;
    fr[1]=fr[2]=1;
    if (fr[3]==0 && fr[4]==0) {
        v=d23+portal4()+c34;
        cost=min(cost,v);
        v=d24+portal3()+c34;
        cost=min(cost,v);
    }
    if (fr[5]==0 && fr[6]==0) {
        v=d25+portal6()+c56;
        cost=min(cost,v);
        v=d26+portal5()+c56;
        cost=min(cost,v);
    }
    fr[1]=fr[2]=0;
    return cost;
}
int portal3( ) {
    int cost;
    cost=n+m-d3;
    int v;
    fr[3]=fr[4]=1;
    if (fr[1]==0 && fr[2]==0) {
        v=d13+portal2()+c12;
        cost=min(cost,v);
        v=d23+portal1()+c12;
        cost=min(cost,v);
    }
    if (fr[5]==0 && fr[6]==0) {
        v=d35+portal6()+c56;
        cost=min(cost,v);
        v=d36+portal5()+c56;
        cost=min(cost,v);
    }
    fr[3]=fr[4]=0;
    return cost;
}

int portal4( ) {
    int cost;
    cost=n+m-d4;
    int v;
    fr[3]=fr[4]=1;
    if (fr[1]==0 && fr[2]==0) {
        v=d14+portal2()+c12;
        cost=min(cost,v);
        v=d24+portal1()+c12;
        cost=min(cost,v);
    }
    if (fr[5]==0 && fr[6]==0) {
        v=d45+portal6()+c56;
        cost=min(cost,v);
        v=d46+portal5()+c56;
        cost=min(cost,v);
    }
    fr[3]=fr[4]=0;
    return cost;
}


int portal5( ) {
    int cost;
    cost=n+m-d5;
    int v;
    fr[5]=fr[6]=1;
    if (fr[1]==0 && fr[2]==0) {
        v=d15+portal2()+c12;
        cost=min(cost,v);
        v=d25+portal1()+c12;
        cost=min(cost,v);
    }
    if (fr[3]==0 && fr[4]==0) {
        v=d35+portal4()+c34;
        cost=min(cost,v);
        v=d45+portal3()+c34;
        cost=min(cost,v);
    }
    fr[5]=fr[6]=0;
    return cost;
}

int portal6( ) {
    int cost;
    cost=n+m-d6;
    int v;
    fr[5]=fr[6]=1;
    if (fr[1]==0 && fr[2]==0) {
        v=d16+portal2()+c12;
        cost=min(cost,v);
        v=d26+portal1()+c12;
        cost=min(cost,v);
    }
    if (fr[3]==0 && fr[4]==0) {
        v=d36+portal4()+c34;
        cost=min(cost,v);
        v=d46+portal3()+c34;
        cost=min(cost,v);
    }
        fr[5]=fr[6]=0;
    return cost;

}