#include <bits/stdc++.h>

 #define sqr(x) ((x)*(x))

 #define MAXN 50000

 #define TO (n+m+2)

 #define FROM (n+m+1)

 #define PO (n+m+2)

 #define INF 2000000000

 #define mid (l+r>>1)

 using namespace std;

 int n,m,k,LI=,ans;

 int to[MAXN],w[MAXN],nex[MAXN],fir[MAXN];

 int h[MAXN],qq[MAXN],flo[MAXN],id[MAXN];

 int ti[MAXN],x[MAXN],y[MAXN],X[MAXN],Y[MAXN],r[MAXN],p[MAXN],q[MAXN],R[MAXN];

 void add(int p,int q,int o)

 {

     to[LI]=q;w[LI]=o;nex[LI]=fir[p];fir[p]=LI;LI++;

     to[LI]=p;w[LI]=;nex[LI]=fir[q];fir[q]=LI;LI++;

 }

 bool bfs()//计算层次图

 {

     int head=-,tail=;

     for(int i=;i<=PO;i++) h[i]=-;

     qq[]=FROM;h[FROM]=;// h[i]：点i的层数

     while(head!=tail)

     {

         int x=qq[++head];

         for(int i=fir[x];i;i=nex[i])

             if(flo[i]&&h[to[i]]==-)

             {

                 h[to[i]]=h[x]+;

                 qq[++tail]=to[i];

             }

     }

     return h[TO]!=-;

 }

 int dfs(int x,int f)//增广路：到点x最大容量为 f

 {

     if(x==TO)return f;

     int w,used=;

     for(int i=fir[x];i;i=nex[i])

         if(h[to[i]]==h[x]+)

         {

             w=dfs(to[i],min(flo[i],f-used));

             flo[i]-=w; flo[i^]+=w;

             used+=w;if(used==f)return f;

         }

     if(!used)h[x]=-;

     return used;

 }

 int dinic() //%usqwedf

 {

     int ans=;

     while(bfs())

         ans+=dfs(FROM,1e9);

     return ans;

 }

 bool ok(int time)

 {

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

         w[id[i]]=time/ti[i]+;

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

         flo[i]=w[i];

     return(dinic()==m);

 }

 int main()

 {

 //    freopen("1.in","r",stdin);

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

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

         scanf("%d%d%d%d",&x[i],&y[i],&r[i],&ti[i]);

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

         scanf("%d%d",&X[i],&Y[i]);

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

         scanf("%d%d%d",&p[i],&q[i],&R[i]);

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

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

         {

             bool flag=sqr(x[i]-X[j])+sqr(y[i]-Y[j])<=sqr(r[i]);

             if(!flag) continue;

             long long a=y[i]-Y[j],b=X[j]-x[i],c=x[i]*Y[j]-y[i]*X[j];

             for(int o=;o<=k;o++)

                 if(sqr(a*p[o]+b*q[o]+c)<=sqr(R[o])*(sqr(a)+sqr(b)) && (sqr(x[i]-p[o])+sqr(y[i]-q[o])<=sqr(R[o]) || sqr(X[j]-p[o])+sqr(Y[j]-q[o])<=sqr(R[o])))

                 {

                     flag=;

                     break;

                 }

             if(flag)

                 add(i,j+n,);

         }

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

         add(i+n,TO,);

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

         id[i]=LI,add(FROM,i,);

     int l,r;

     for(l=,r=;l<r;)

     if(ok(mid)) r=mid;else l=mid+;

     if(ok(l))

         printf("%d\n",l);

     else

         puts("-1");

     return ;

 }