#include <cstdio>
#include <complex>
#include <vector>
using namespace std;
typedef complex<double> p_t;
#define eps 1e-8

struct e_t{
  p_t f,t;
  int o,l;
};

struct s_t {
  p_t p;
  int o,l;
};

#define N 102
int m;
p_t a,b;
e_t es[N];

int operator<(const s_t& lhs, const s_t& rhs)
{
  double ad=abs(lhs.p-a);
  double bd=abs(rhs.p-a);
  return ad<bd-eps;
}

double det(p_t p, p_t q)
{
  return imag(conj(p)*q);
}

int ccw(p_t p1, p_t p2, p_t p3)
{
  p2-=p1,p3-=p1;
  if (det(p2,p3)>eps) return 1;
  if (det(p2,p3)<-eps) return -1;

  if (real(p2)*real(p3)<-eps||imag(p2)*imag(p3)<-eps) return 1;

  if (norm(p2)<norm(p3)-eps) return -1;
  return 0;
}

int intersect(p_t p1, p_t p2, p_t p3, p_t p4)
{
  return ccw(p1,p2,p3)*ccw(p1,p2,p4)<=0&&ccw(p3,p4,p1)*ccw(p3,p4,p2)<=0;
}

p_t xp(p_t a, p_t u, p_t b, p_t v)
{
  double d=det(u,v);
  double s=det(b-a,v)/d;
  return a+s*u;
}

int check(int ll, vector<s_t>& ss)
{
  int ret=0;
  for (int i=0;i<ss.size();++i) {
    if (ss[i].o==1) {
      if (ss[i].l!=ll) {
	++ret;
	ll=1-ll;
      }
    } else {
      if (ss[i].l==ll) {
	++ret;
	ll=1-ll;
      }
    }
  }
  return ret;
}


int main()
{
  int l; scanf("%d",&l);
  while(l--) {
    double ax,ay,bx,by;
    scanf("%lf%lf%lf%lf",&ax,&ay,&bx,&by);
    a=p_t(ax,ay);
    b=p_t(bx,by);
    scanf("%d",&m);
    for (int i=0;i<m;++i) {
      double fx,fy,tx,ty;
      int o,l;
      scanf("%lf%lf%lf%lf%d%d",&fx,&fy,&tx,&ty,&o,&l);
      es[i].f=p_t(fx,fy);
      es[i].t=p_t(tx,ty);
      es[i].o=o;
      es[i].l=l;
    }
    
    vector<s_t> ss;
    for (int i=0;i<m;++i) {
      if (intersect(a,b,es[i].f,es[i].t)) {
	p_t p=xp(a,b-a,es[i].f,es[i].t-es[i].f);
	s_t s;
	//printf("%lf %lf %d %d\n",real(p),imag(p),es[i].o,es[i].l);
	s.p=p;
	s.o=es[i].o;
	s.l=es[i].l;
	ss.push_back(s);
      }
    }
    sort(ss.begin(),ss.end());

    printf("%d\n",min(check(0,ss),check(1,ss)));
  }
}