#include <cstdio>
#include <cstdlib>
#include <algorithm>
#define MAXT 10001
#define MAXL 101
using namespace std;
const int INF=~0u>>2;
int F[MAXT][MAXL];
int T,S,N;
class LESS{public:int start,last,level;}L[MAXL];
class SKI{public:int time,level;}Y[MAXT];
int Lesson[MAXT];
bool cmp(const LESS&a,const LESS&b) {return a.last<b.last;}
inline int Min(int a,int b) {return a<b?a:b;}
inline int Max(int a,int b) {return a>b?a:b;}

void init()
{
	scanf("%d %d %d\n",&T,&S,&N);
	for(int i=1;i<=S;i++) scanf("%d %d %d\n",&L[i].start,&L[i].last,&L[i].level),L[i].last+=L[i].start;
	for(int i=1;i<=N;i++) scanf("%d %d\n",&Y[i].level,&Y[i].time);
	for(int i=1;i<MAXL;i++) Lesson[i]=INF; L[++S].start=0,L[S].last=0,L[S].level=1;
	for(int i=1;i<=N;i++) Lesson[Y[i].level]=Min(Lesson[Y[i].level],Y[i].time);
	for(int i=2;i<MAXL;i++) Lesson[i]=Min(Lesson[i],Lesson[i-1]);
	sort(L+1,L+S+1,cmp);
}

void dp()
{
	F[0][1]=0;
	for(int i=1;i<=S;i++)
	{
		if(L[i].last>T) continue;
		for(int j=1;j<i;j++) F[L[i].last][L[i].level]=Max(F[L[i].last][L[i].level],F[L[i].start+1][L[j].level]);
		for(int j=L[i].last+1;j<=T;j++)
		{
			if(j>=Lesson[L[i].level]) F[j][L[i].level]=Max(F[j-1][L[i].level],F[j-Lesson[L[i].level]][L[i].level]+1);
			else F[j][L[i].level]=F[j-1][L[i].level];
		}
	}
	int ans=0;
	for(int i=1;i<=S;i++)
		ans=Max(ans,F[T][L[i].level]);
	printf("%d\n",ans);
}

int main()
{
	freopen("ski.in","r",stdin);
	freopen("ski.out","w",stdout);
	init();
	dp();
	return 0;
}