#include <bits/stdc++.h>

using namespace std;

// #define LOCK_GETCHAR
// #define USE_INT_128

#if __cplusplus < 201400
#warning "Please use c++14 or higher."
#define CONSTEXPR_FUNC
#define ENABLE_IF_INT
#else
#define CONSTEXPR_FUNC constexpr
#define ENABLE_IF_INT , enable_if_t<_is_integer<T>, int> = 0
template <class T> constexpr bool _is_integer = numeric_limits<T>::is_integer;
template <> constexpr bool _is_integer<bool> = false;
template <> constexpr bool _is_integer<char> = false;
#ifdef USE_INT_128
template <> constexpr bool _is_integer<__int128> = true;
template <> constexpr bool _is_integer<__uint128_t> = true;
#endif
#endif

#if !defined(_WIN32) && !defined(__CYGWIN__) && !defined(LOCK_GETCHAR)
#define getchar getchar_unlocked
#endif

#define il inline
#define mkp make_pair
#define fi first
#define se second
#define ssz(x) (signed((x).size()))
#define _loop_i_t(j, k) make_signed_t<decltype((j) - (k))>
#define For(i, j, k) for (_loop_i_t(j, k) i = (j); i <= (k); ++i) // NOLINT
#define ForDown(i, j, k)                                                       \
  for (_loop_i_t(j, k) i = (j); i >= decltype(i)(k); --i) // NOLINT
#define eb emplace_back
#ifndef ONLINE_JUDGE
#define FileIO(filename)                                                       \
  freopen(filename ".in", "r", stdin);                                         \
  freopen(filename ".out", "w", stdout)
#else
#define FileIO(filename) void(0)
#endif

using ll = long long;
using uint = unsigned int;
using ull = unsigned long long;
using db = double;
using ldb = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#ifdef USE_INT_128
using lll = __int128_t;
using ulll = __uint128_t;
#endif

// clang-format off
CONSTEXPR_FUNC il ll qpow(ll x, ull y, ll mod){ ll ans = 1; x %= mod; while (y) { if (y & 1) (ans *= x) %= mod; (x *= x) %= mod; y >>= 1; } return ans; }
template<typename T> CONSTEXPR_FUNC il void cmin(T & x, const T &y){ x = min(x, y); }
template<typename T> CONSTEXPR_FUNC il void cmax(T & x, const T &y){ x = max(x, y); }
template<typename T ENABLE_IF_INT> il void read(T &x){ x = 0; int f = 1; int c = getchar(); while (!isdigit(c)) { if (c == '-') f = -1; c = getchar(); } while (isdigit(c)) { x = x * 10 + (c - '0'); c = getchar(); } x *= f; }
template<typename T, typename ... Args> il void read(T &x, Args &... y){ read(x), read(y...); }
// clang-format on

// File head end

namespace {
constexpr ll MAXN = 1e6 + 5, B = 2500;
int n, m, fa[MAXN], _id[MAXN], tot = 0, bl[MAXN], key[2048][2], pos[MAXN],
                               onTr[MAXN], dep[MAXN];
vector<int> T[MAXN];
vector<pii> st;
bool isKey[MAXN];
pii b[MAXN];
vector<tuple<int, int, int>> todo[MAXN];
vector<tuple<int, int, int>> ans;
vector<pii> todo2[MAXN];

void dfs1(int x) {
  dep[x] = dep[fa[x]] + 1;
  int cur = ssz(st), cnt = 0;
  for (int v : T[x]) {
    st.eb(x, v), dfs1(v), cnt += !!pos[v], _id[v] = ssz(st);
    if (pos[v] && !pos[x])
      pos[x] = pos[v];
  }
  if (x == 1 || cnt >= 2 || ssz(st) - cur >= B) {
    cnt = 0, pos[x] = x, isKey[x] = 1;
    // cerr << "U " << x << '\n';
    int qwq = 0, pre = 0, cur0 = cur;
    for (int v : T[x]) {
      if (cnt + (!!pos[v]) == 2 || _id[v] - cur > B) {
        assert(pre);
        ++tot;
        key[tot][0] = x, key[tot][1] = qwq;
        // cerr << "V " << v << ' ' << qwq << '\n';
        For(i, cur + 1, _id[pre]) {
          if (!isKey[st[i].fi])
            bl[st[i].fi] = tot;
          if (!isKey[st[i].se])
            bl[st[i].se] = tot;
        }
        cur = _id[pre], cnt = qwq = 0;
      }
      if (pos[v])
        qwq = pos[v], cnt++;
      pre = v;
    }
    ++tot;
    key[tot][0] = x, key[tot][1] = qwq;
    // cerr << "V back " << qwq << '\n';
    For(i, cur + 1, _id[pre]) {
      if (!isKey[st[i].fi])
        bl[st[i].fi] = tot;
      if (!isKey[st[i].se])
        bl[st[i].se] = tot;
    }
    st.resize(cur0);
  }
}
void dfs2(int x) {
  if (isKey[x]) {
    sort(todo[x].begin(), todo[x].end());
    int c = 0;
    for (auto [d, u, id] : todo[x]) {
      ans.eb(1, x, d), c++;
      ans.eb(1, u, d + dep[x] - dep[u]);
      ans.eb(3, id, 0);
      ans.eb(2, 0, 0);
    }
    For(_, 1, c) ans.eb(2, 0, 0);
  }
  for (int v : T[x])
    dfs2(v);
}
void dfs3(int x) {
  sort(todo2[x].begin(), todo2[x].end());
  for (auto [d, id] : todo2[x])
    ans.eb(1, x, d), ans.eb(3, id, 0);
  For(_, 1, ssz(todo2[x])) ans.eb(2, 0, 0);
  for (int v : T[x]) {
    dfs3(v);
  }
}

void Main() {
  read(n, m);
  For(i, 2, n) read(fa[i]), T[fa[i]].eb(i);
  dfs1(1);
  For(i, 1, tot) if (key[i][1]) {
    int p = key[i][1];
    while (p != key[i][0]) {
      onTr[p] = key[i][1], p = fa[p];
    }
  }
  cerr << tot << '\n';
  assert(key[tot][0] == 1), onTr[1] = key[tot][1];
  For(i, 1, m) {
    auto &[x, d] = b[i];
    read(x, d);
    if (!onTr[x] || dep[onTr[x]] >= dep[x] + d)
      todo2[x].eb(d, i);
    else
      todo[onTr[x]].eb(d - (dep[onTr[x]] - dep[x]), x, i);
  }
  dfs2(1);
  cerr << ssz(ans) << '\n';
  dfs3(1);
  cerr << ssz(ans) << '\n';
  printf("%d\n", ssz(ans));
  for (auto [x, y, z] : ans) {
    if (x == 1)
      printf("%d %d %d\n", x, y, z);
    else if (x == 2)
      printf("%d\n", x);
    else
      printf("%d %d\n", x, y);
  }
}
} // namespace

signed main() { return Main(), 0; }