#include<iostream>
#include<cmath>
#include<vector>
#include<algorithm>
#include<cassert>
#define REP(i,s,n) for(int i=s;i<n;i++)
#define rep(i,n) REP(i,0,n)
#define inf (1<<29)
#define EPS (1e-10)
#define COUNTER_CLOCKWISE 1
#define CLOCKWISE -1 
#define ONLINE_BACK 2
#define ONLINE_FRONT -2
#define ON_SEGMENT 0
#define equals(a,b) (fabs((a)-(b)) < EPS)
#define MAX 1000
using namespace std;

// library --- start
class Point
{
  public:
  double x,y;

  Point(double x = -1,double y = -1): x(x),y(y){}

  Point operator + (Point p ){return Point(x+p.x,y+p.y);}
  Point operator - (Point p){return Point(x-p.x,y-p.y);}
  Point operator * (double a){return Point(a*x,a*y);}
  Point operator / (double a){return Point(x/a,y/a);}//※イケメンに限る

  bool operator < (const Point& p) const{ return !equals(x,p.x)?x<p.x:y<p.y; }

};

struct Segment
{
  Point p1,p2;
  Segment(Point p1 = Point(-1,-1),Point p2 = Point(-1,-1)):p1(p1),p2(p2){}
};
typedef Point Vector;
typedef Segment Line;
typedef vector<Point> Polygon;

double dot(Point a,Point b){ return a.x*b.x + a.y*b.y; }

double cross(Point a,Point b){ return a.x*b.y - a.y*b.x; }

double norm(Point a){ return a.x*a.x+a.y*a.y; }

double abs(Point a){ return sqrt(norm(a)); }

bool pequals(Point a,Point b){ return equals(a.x,b.x) && equals(a.y,b.y); }

Point rotate(Point a,double rad){ return Point(cos(rad)*a.x - sin(rad)*a.y,sin(rad)*a.x + cos(rad)*a.y); }

double toRad(double agl){ return agl*M_PI/180.0; }


int ccw(Point p0,Point p1,Point p2)
{
  Point a = p1-p0;
  Point b = p2-p0;
  if(cross(a,b) > EPS)return COUNTER_CLOCKWISE;
  if(cross(a,b) < -EPS)return CLOCKWISE;
  if(dot(a,b) < -EPS)return ONLINE_BACK;
  if(norm(a) < norm(b))return ONLINE_FRONT;
  return ON_SEGMENT;
}



bool intersectLL(Line l, Line m) {
  return abs(cross(l.p2-l.p1, m.p2-m.p1)) > EPS || // non-parallel
         abs(cross(l.p2-l.p1, m.p1-l.p1)) < EPS;   // same line
}
bool intersectLS(Line l, Line s) {
  return cross(l.p2-l.p1, s.p1-l.p1)*       // s[0] is left of l
         cross(l.p2-l.p1, s.p2-l.p1) < EPS; // s[1] is right of l
}
bool intersectLP(Line l,Point p) {
  return abs(cross(l.p2-p, l.p1-p)) < EPS;
}
bool intersectSS(Line s, Line t) {
  return ccw(s.p1,s.p2,t.p1)*ccw(s.p1,s.p2,t.p2) <= 0 &&
         ccw(t.p1,t.p2,s.p1)*ccw(t.p1,t.p2,s.p2) <= 0;
}
bool intersectSP(Line s, Point p) {
  return abs(s.p1-p)+abs(s.p2-p)-abs(s.p2-s.p1) < EPS; // triangle inequality
}

Point projection(Line l,Point p) {
  double t = dot(p-l.p1, l.p1-l.p2) / norm(l.p1-l.p2);
  return l.p1 + (l.p1-l.p2)*t;
}
Point reflection(Line l,Point p) {
  return p + (projection(l, p) - p) * 2;
}
double distanceLP(Line l, Point p) {
  return abs(p - projection(l, p));
}
double distanceLL(Line l, Line m) {
  return intersectLL(l, m) ? 0 : distanceLP(l, m.p1);
}

double distanceLS(Line l, Line s) {
  if (intersectLS(l, s)) return 0;
  return min(distanceLP(l, s.p1), distanceLP(l, s.p2));
}
double distanceSP(Line s, Point p) {
  Point r = projection(s, p);
  if (intersectSP(s, r)) return abs(r - p);
  return min(abs(s.p1 - p), abs(s.p2 - p));
}

double distanceSS(Line s, Line t) {
  if (intersectSS(s, t)) return 0;
  return min(min(distanceSP(s, t.p1), distanceSP(s, t.p2)),
             min(distanceSP(t, s.p1), distanceSP(t, s.p2)));
}
Point crosspoint(Line l, Line m) {
  double A = cross(l.p2 - l.p1, m.p2 - m.p1);
  double B = cross(l.p2 - l.p1, l.p2 - m.p1);
  if (abs(A) < EPS && abs(B) < EPS) return m.p1; // same line
  if (abs(A) < EPS) assert(false); // !!!PRECONDITION NOT SATISFIED!!!
  return m.p1 +   (m.p2 - m.p1) * (B / A);
}

// library --- end

struct Pox
{
  Segment s;
  double dist;
  bool o,l;
  Pox(Segment s=Segment(),double dist=inf,bool o=false,bool l=false):s(s),dist(dist),o(o),l(l){}

  bool operator < (const Pox& a)const{ return dist < a.dist; }

};

Point a,b;
int n;
Segment seg[MAX];
Pox     pox[MAX];

int compute(bool state)
{
  //cout << "first state : " << (state?"kouka":"tika") << endl;
  int cnt = 0;
  rep(i,n)//0
    {
      if(pox[i].dist == inf)break;
      //cout << i << "-th " << (state?"kouka":"tika") << endl;
      if(pox[i].o)
	{//it's me
	  if(pox[i].l == state)
	    {
		      
	    }
	  else
	    {//cout << "add!" << endl;
	      cnt++;
	      state = !state;
	    }
	}
      else
	{//mario
	  if(pox[i].l == state)
	    {//cout << "add!" << endl;
	      cnt++;
	      state = !state;
	    }
	  else
	    {

	    }
	}
    }
  //cout << "cnt = " << cnt << endl;
  return cnt;
}

int main()
{
  int T;
  while(cin >> T)
    {
      while(T--)
	{
	  cin >> a.x >> a.y >> b.x >> b.y;
	  cin >> n;
	  rep(i,n)
	    {
	      cin >> seg[i].p1.x >> seg[i].p1.y >> seg[i].p2.x >> seg[i].p2.y >> pox[i].o >> pox[i].l;
	      pox[i].s = seg[i];
	      Point p = (intersectSS(Segment(a,b),seg[i])?crosspoint(Segment(a,b),seg[i]):Point(inf,inf));
	      pox[i].dist = (intersectSS(Segment(a,b),seg[i])?sqrt(norm(a-p)):inf);
	    }	  
	  sort(pox,pox+n); 
	  /*
	  cout << "------------" << endl;
	  rep(i,n)
	    {
	      if(pox[i].dist == inf)break;
	      cout << "( (" << pox[i].s.p1.x << "," << pox[i].s.p1.y << ") (" << pox[i].s.p2.x << "," << pox[i].s.p2.y << ") )" << endl;
	      cout << "dist = " << pox[i].dist << endl;
	      cout << (pox[i].o?"you":"he") << " " << (pox[i].l?"kouka":"tika") << endl;
	      cout << endl;
	    }
	  cout << endl;
	  */
	  cout << min(compute(false),compute(true)) << endl;
	}
    }
  return 0;
}
 

Measured memory_bytes: 1312