#include <bits/stdc++.h>
using namespace std;
#define int long long
const int B = 450;
int n, q, a[200010], fa[200010], par[200010];
vector<pair<int, int>> e[200010];
int p[400010], cnt, eur[200010], nfd[200010], dfn[200010], tot, out[200010];
void dfs(int now) {
	p[++cnt] = now, eur[now] = cnt;
	nfd[dfn[now] = ++tot] = now;
	for (auto [v, w] : e[now])
		dfs(v), p[++cnt] = {now};
	out[now] = tot;
}
pair<int, int> qq[200010], ch[200010], ans[200010];
struct node {
	int mx, mi, tag;
} t[200010 * 4];
#define lson (now << 1)
#define rson (now << 1 | 1)
#define mid ((l + r) >> 1)
void build(int now, int l = 1, int r = n) {
	if (l == r) {
		t[now].mi = nfd[l], t[now].mx = -a[nfd[l]];
		return;
	}
	build(lson, l, mid), build(rson, mid + 1, r);
	if (t[lson].mx > t[rson].mx || (t[lson].mx == t[rson].mx && t[lson].mi <= t[rson].mi))
		t[now].mx = t[lson].mx, t[now].mi = t[lson].mi;
	else t[now].mx = t[rson].mx, t[now].mi = t[rson].mi;
}
void add(int now, int ql, int qr, int x, int l = 1, int r = n) {
	if (ql <= l && qr >= r) {
		t[now].mx += x, t[now].tag += x;
		return;
	}
	if (ql <= mid) add(lson, ql, qr, x, l, mid);
	if (qr > mid) add(rson, ql, qr, x, mid + 1, r);
	if (t[lson].mx > t[rson].mx || (t[lson].mx == t[rson].mx && t[lson].mi <= t[rson].mi))
		t[now].mx = t[lson].mx, t[now].mi = t[lson].mi;
	else t[now].mx = t[rson].mx, t[now].mi = t[rson].mi;
	t[now].mx += t[now].tag;
}
void dfs2(int now) {
	for (auto [v, w] : e[now])
		add(1, dfn[v], out[v], w), dfs2(v);
}
signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0), cout.tie(0);
	cin >> n >> q;
	for (int i = 1; i <= n; i++)
		cin >> a[i];
	for (int i = 2; i <= n; i++) {
		cin >> fa[i] >> par[i];
		e[fa[i]].push_back({i, par[i]});
	}
	dfs(1);
	for (int i = 1; i <= q; i++) {
		cin >> qq[i].second >> ch[i].first >> ch[i].second;
		qq[i].first = i, qq[i].second = eur[qq[i].second];
	}
	sort(qq + 1, qq + q + 1, [&](auto x, auto y) {
		if (x.first / B != y.first / B) return x.first < y.first;
		if (x.first / B % 2 == 0) return x.second < y.second;
		return x.second > y.second;
	});
	build(1), dfs2(1);
	int nowx = 1, nowq = 0, res = 0;
	auto mov = [&](int now, int nxt) {
		if (fa[nxt] == now)
			res += par[nxt], add(1, dfn[nxt], out[nxt], -par[nxt] * 2);
		else res -= par[now], add(1, dfn[now], out[now], par[now] * 2);
	};
	auto turn = [&](int i, int flag) {
		add(1, dfn[ch[i].first], out[ch[i].first], ch[i].second * flag);
	};
	for (int i = 1; i <= q; i++) {
		int toq = qq[i].first, tox = qq[i].second;
		while (nowx < tox) mov(p[nowx], p[nowx + 1]), nowx++;
		while (nowx > tox) mov(p[nowx], p[nowx - 1]), nowx--;
		while (nowq < toq) turn(++nowq, -1);
		while (nowq > toq) turn(nowq--, 1);
		ans[toq] = {t[1].mi, t[1].mx + res};
	}
	for (int i = 1; i <= q; i++)
		cout << ans[i].first << " " << ans[i].second << endl;
	return 0;
}