#include <bits/stdc++.h>

using namespace std;

#define int long long

const int N = 200'000 + 10;
int n, q;
int a[N];
int par[N];
vector<pair<int, int>> ad[N];

int d[N], st[N], rvs[N], ed[N], it;
void dfs0(int u) { 
  st[u] = ++it; rvs[it] = u;
  for (const auto& [v, w] : ad[u]) { 
    d[v] = d[u] + w;
    par[v] = u;
    dfs0(v);
  }
  ed[u] = it;
}

pair<int, int> f[N << 2];
int lazy[N << 2];
void build(int s, int l, int r) { 
  if (l == r) {  
    f[s].first = d[rvs[l]] - a[rvs[l]];
    f[s].second = -rvs[l];
    return;
  }
  int mid = l + r >> 1;
  build(s << 1, l, mid); build(s << 1 | 1, mid + 1, r);
  f[s] = max(f[s << 1], f[s << 1 | 1]);
}
void push(int s) { 
  f[s << 1].first += lazy[s];   f[s << 1 | 1].first += lazy[s];
  lazy[s << 1] += lazy[s];      lazy[s << 1 | 1] += lazy[s];
  lazy[s] = 0;
}
void update(int s, int l, int r, int u, int v, int x) { 
  if (v < l || u > r) return;
  if (u <= l && r <= v) { 
    f[s].first += x;
    lazy[s] += x;
    return;
  }
  push(s);
  int mid = l + r >> 1;
  update(s << 1, l, mid, u, v, x); update(s << 1 | 1, mid + 1, r, u, v, x);
  f[s] = max(f[s << 1], f[s << 1 | 1]);
}
pair<int, int> query(int s, int l, int r, int u, int v) { 
  if (v < l || u > r) return {-1'000'000'000'000'000, 0};
  if (u <= l && r <= v) return f[s];
  push(s);
  int mid = l + r >> 1;

  return max(query(s << 1, l, mid, u, v), query(s << 1 | 1, mid + 1, r, u, v));
}

int32_t main() { 
  cin.tie(0)->sync_with_stdio(0);

  cin >> n >> q;
  for (int i = 1; i <= n; ++i) cin >> a[i];
  for (int v = 2; v <= n; ++v) { 
    int u, w; cin >> u >> w;
    ad[u].push_back({v, w});
  }

  dfs0(par[1] = 1);
  build(1, 1, n);

  while (q--) { 
    int x, y, v; cin >> x >> y >> v;
    int start = x;
    update(1, 1, n, st[y], ed[y], -v);

    pair<int, int> answer = query(1, 1, n, st[x], ed[x]);
    answer.first -= d[x];
    while (true) { 
      int u = par[x];
      if (x == 1) break;
      
      auto ret = max(query(1, 1, n, st[u], st[x] - 1), query(1, 1, n, ed[x] + 1, ed[u]));
      ret.first += d[start] - d[u];
      answer = max(answer, ret);  
      
      x = u;
    }

    cout << -answer.second << " " << answer.first << "\n";
  }
}