#include <cstdio>

#include <cstring>

const int MAXN=;//点数的最大值

const int MAXM=;//边数的最大值

const int INF=0x3fffffff;

struct Node

{

    int from,to,next;

    int cap;

}edge[MAXM];

int tol;

int head[MAXN];

int dep[MAXN];

int gap[MAXN];//gap[x]=y :说明残留网络中dep[i]==x的个数为y

int n;//n是总的点的个数，包括源点和汇点

void init()

{

    tol=;

    memset(head,-,sizeof(head));

}

void addedge(int u,int v,int w)

{

    edge[tol].from=u;

    edge[tol].to=v;

    edge[tol].cap=w;

    edge[tol].next=head[u];

    head[u]=tol++;

    edge[tol].from=v;

    edge[tol].to=u;

    edge[tol].cap=w;

    edge[tol].next=head[v];

    head[v]=tol++;

}

void BFS(int start,int end)

{

    memset(dep,-,sizeof(dep));

    memset(gap,,sizeof(gap));

    gap[]=;

    int que[MAXN];

    int front,rear;

    front=rear=;

    dep[end]=;

    que[rear++]=end;

    while(front!=rear)

    {

        int u=que[front++];

        if(front==MAXN)front=;

        for(int i=head[u];i!=-;i=edge[i].next)

        {

            int v=edge[i].to;

            if(dep[v]!=-)continue;

            que[rear++]=v;

            if(rear==MAXN)rear=;

            dep[v]=dep[u]+;

            ++gap[dep[v]];

        }

    }

}

int SAP(int start,int end)

{

    int res=;

    BFS(start,end);

    int cur[MAXN];

    int S[MAXN];

    int top=;

    memcpy(cur,head,sizeof(head));

    int u=start;

    int i;

    while(dep[start]<n)

    {

        if(u==end)

        {

            int temp=INF;

            int inser;

            for(i=;i<top;i++)

               if(temp>edge[S[i]].cap)

               {

                   temp=edge[S[i]].cap;

                   inser=i;

               }

            for(i=;i<top;i++)

            {

                edge[S[i]].cap-=temp;

                edge[S[i]^].cap+=temp;

            }

            res+=temp;

            top=inser;

            u=edge[S[top]].from;

        }

        if(u!=end&&gap[dep[u]-]==)//出现断层，无增广路

          break;

        for(i=cur[u];i!=-;i=edge[i].next)

           if(edge[i].cap!=&&dep[u]==dep[edge[i].to]+)

             break;

        if(i!=-)

        {

            cur[u]=i;

            S[top++]=i;

            u=edge[i].to;

        }

        else

        {

            int min=n;

            for(i=head[u];i!=-;i=edge[i].next)

            {

                if(edge[i].cap==)continue;

                if(min>dep[edge[i].to])

                {

                    min=dep[edge[i].to];

                    cur[u]=i;

                }

            }

            --gap[dep[u]];

            dep[u]=min+;

            ++gap[dep[u]];

            if(u!=start)u=edge[S[--top]].from;

        }

    }

    return res;

}

int main()

{

    int T,m;

    int s,t,x1,x2;

    scanf("%d",&T);

    while(T--)

    {

        scanf("%d%d",&n,&m);

        scanf("%d%d",&x1,&x2);

        x2 = x1;

        s = t = ;

        for(int i = ;i <= n;i++)

        {

            int x,y;

            scanf("%d%d",&x,&y);

            if(x < x1)

            {

                s = i;

                x1 = x;

            }

            else if(x > x2)

            {

                t = i;

                x2 = x;

            }

        }

        init();

        for(int i = ;i < m;i++)

        {

            int u,v,w;

            scanf("%d%d%d",&u,&v,&w);

            addedge(u,v,w);

        }

        printf("%d\n",SAP(s,t));

    }

    return ;

}