#include<stdio.h>
#include<algorithm>
#include<vector>
#include<queue>
using namespace std;
struct edge
{
	int to;
	int w;
};
vector<edge> g[105];
int u[105],state[105];
int n, p;
int main()
{
	queue<int> q;
	scanf("%d %d", &n, &p);
	for (int i = 1; i <= n; i++)
	{
		scanf("%d %d",&u[i],&state[i]);
		if (u[i] != 0) u[i] = 0;
		if (state[i] > 0) q.push(i);
	}
	int x;
	edge item;
	for (int i = 1; i <= p; i++)
	{
		scanf("%d %d %d", &x, &item.to, &item.w);
		g[x].push_back(item);
	}

	for (;q.size()!=0;)
	{
		int x=q.front();
		q.pop();
		state[x] -= u[x];
		if (state[x] <= 0) continue;
		for (int i = 0; i < g[i].size(); i++)
		{
			state[g[x][i].to] += state[i] * g[x][i].w;
		}
	}
	bool flag = 0;
	for (int i = 1; i <= n; i++)
	{
		if (g[i].size() == 0 && state[i] > 0)
		{
			flag = 1;
			printf("%d %d\n", i, state[i]);
		}
	}
	if (flag == 0) printf("NULL");
	return 0;
}