#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<ll,ll>
#define vi vector<ll>
#define pb emplace_back
#define fi first
#define se second
#define all(n) (n).begin(),(n).end()
#define siz(n) (int)n.size()
#define IOS ios::sync_with_stdio(0), cin.tie(0);
#define dbg(x) cerr<<#x<<" = "<<x<<'\n';
const ll mxn = 1000005;
string name[mxn];
vector<pii> E[mxn];
ll len[mxn], son[mxn], mnlen[mxn], pa[mxn], ans[mxn];
int N, M;

void dfs_len(int nd,int p){
	ll mn_down = 1e17;
	for(auto &[i,l]:E[nd]){
		if(i == p) continue;
		pa[i] = nd;
		son[nd]++;
		len[i] = len[nd] + l;
		mnlen[i] = l;
		dfs_len(i, nd);
		mn_down = min(mn_down, mnlen[i]);
	}
	if(mn_down < 1e17) mnlen[nd] += mn_down;
	if(nd == 0) mnlen[nd] = 0;
}

priority_queue<pii, vector<pii>, greater<pii>> pq;
int main(){
	IOS;
	cin>>N>>M;
	M++;
	for(int i=M,p,l;i<M+N;i++){
		cin>>name[i];
		cin>>p>>l;
		E[p].pb(i,l);
		E[i].pb(p,l);
	}
	for(int i=1,p,l;i<M;i++){
		cin>>p>>l;
		E[p].pb(i,l);
		E[i].pb(p,l);
	}
	dfs_len(0, -1);
	vector<pii> all_len;
	for(int i=M;i<N+M;i++){
		pq.emplace(mnlen[i], i);
		all_len.pb(len[i], i);
	}
	sort(all(all_len));
	for(auto &[d, i]: all_len){
		while(!pq.empty() && pq.top().fi <= d){
			auto [_, nd] = pq.top(); pq.pop();
			while(pa[nd] != 0){
				nd = pa[nd];
				son[nd]--;
				if(son[nd] == 0 && mnlen[nd] > d){
					pq.emplace(mnlen[nd], nd);
					break;
				}
				else if(son[nd] > 0) break;
			}
		}
		ans[i] = pq.size()+1;
	}
	for(int i=M;i<M+N;i++){
		cout<<name[i]<<" "<<ans[i]<<'\n';
	}
}