#include<iostream>
#include<cstdio>
#include<algorithm>

using namespace std;

const int maxn=200+20;

struct Node
{
	int from;
	int to;
	int dist;
}node[maxn];

int inq[maxn];
int con[maxn];
int n,m;
int sum[maxn]={0};
int t=0;

int main()
{
	freopen("sjwl.in","r",stdin);
	freopen("sjwl.out","w",stdout);
	scanf("%d%d",&n,&m);
	for(int i=1;i<=n;i++)
	{
		scanf("%d%d",&con[i],&inq[i]);
	}
	for(int i=1;i<=m;i++)
	{
		scanf("%d%d%d",&node[i].from,&node[i].to,&node[i].dist);
		sum[node[i].to]++;
	}
	for(int i=1;i<=n;i++)
	{
		if(sum[i]%2==1)
		{
			if(inq[i]==1) inq[i]=0;
			if(inq[i]==0) inq[i]=1;
		}
	}
	for(int i=1;i<=n;i++)
	{
		if(inq[i]==1)
		{
			printf("%d %d\n",i,inq[i]);
			if(i==n) return 0;
		}
		if(inq[i]==0)
		{
			t++;
		}
	}
	if(t==n)
	{
		printf("NULL");
	}
	return 0;
}