#include<bits/stdc++.h>

typedef long long LL;

const int N = 100000;

const int M = 5000;

const int inf = 2147483647;

const int p = 2019;

char buf[1 << 23], *p1 = buf, *p2 = buf, obuf[1 << 23], *O = obuf;

inline void _(char ch){*O++ = ch;}

void print(int x) {if(x < 0) _('-'), x = -x; if(x>9) print(x/10);*O++ = x % 10 ^ 48;}

inline int read(){

	int res = 0; char ch = getchar(); bool bo = false;

	while(ch < '0' || ch > '9') bo = (ch == '-'), ch = getchar();

	while(ch >= '0' && ch <= '9') res = (res << 1) + (res << 3) + (ch ^ 48), ch = getchar();

	return bo ? -res : res;

}

int getc() {

	char ch = getchar();

	while(ch != 'A' && ch != 'I') ch = getchar();

	return ch == 'I';

}

struct Edge {

	int to;

	Edge *nxt;

	Edge (int to, Edge *nxt) : to(to), nxt(nxt) {}

}*head[N];

int dep[N], a[N], size[N], siz[N], son[N], Top[N], fa[N], dfn[N], nfd[N], tot;

struct Segment {

	struct node {

		int sum, tag, siz;

		int l, r;

		node *L, *R;

		node(int l, int r) : sum(0), tag(0), siz(0), l(l), r(r), L(NULL), R(NULL) {}

		void up() {

			siz = (L->siz + R->siz) % p;

			sum = (L->sum + R->sum) % p;

		}

		void down() {

			L->sum = (L->sum + L->siz * tag) % p;

			R->sum = (R->sum + R->siz * tag) % p;

			L->tag = (L->tag + tag) % p; R->tag = (R->tag + tag) % p;

			tag = 0;

		}

		int mid() {return (l + r) >> 1;}

	}*root;

	void bulid(node *&o, int l, int r, bool bo) {

		o = new node(l, r);

		if(l == r) {

			int Siz = siz[nfd[l]] % p;

			if(bo) Siz = ((LL)Siz * siz[nfd[l]]) % p;

			o->siz = Siz;

			o->sum = (Siz * a[nfd[l]]) % p;

			return;

		}

		bulid(o->L, l, o->mid(), bo);

		bulid(o->R, o->mid() + 1, r, bo);

		o->up();

	} 

	void chenge(node *o, int l, int r, int tag) {

		if(o->l >= l && o->r <= r) {

			o->sum = (o->sum + o->siz * tag) % p;

			o->tag = (o->tag + tag) % p;

			return;

		}

		if(o->tag) o->down();

		if(o->mid() >= l) chenge(o->L, l, r, tag);

		if(o->mid() < r) chenge(o->R, l, r, tag);

		o->up();

	}

	int ask(node *o, int l, int r) {

		if(o->l >= l && o->r <= r) return o->sum;

		if(o->tag) o->down();

		int ans = 0;

		if(o->mid() >= l) ans += ask(o->L, l, r);

		if(o->mid() < r) ans += ask(o->R, l, r);

		return ans % p;

	}

}wfx, cdy;

void dfs(int x, int f) {

	dep[x] = dep[fa[x] = f] + (siz[x] = 1);

	for(Edge *i = head[x]; i; i = i->nxt) {

		if(i->to == f) continue;

		dfs(i->to, x);

		siz[x] += siz[i->to];

		if(siz[i->to] > siz[son[x]]) son[x] = i->to;

	}

}

void dfs(int x, int f, int top) {

	Top[nfd[dfn[x] = ++tot] = x] = top;

	if(son[x]) dfs(son[x], x, top);

	for(Edge *i = head[x]; i; i = i->nxt)  {

		if(i->to == son[x] || i->to == f) continue;

		dfs(i->to, x, i->to);

	}

}

void chenge(int x, int y, int d) {

	if(x == y) return;

	while(Top[x] != Top[y]) {

		if(dep[Top[x]] < dep[Top[y]]) std::swap(x, y);

		wfx.chenge(wfx.root, dfn[Top[x]], dfn[x], d);

		cdy.chenge(cdy.root, dfn[Top[x]], dfn[x], d);

		x = fa[Top[x]];

	}

	if(x == y) return;

	if(dep[x] > dep[y]) std::swap(x, y);

	wfx.chenge(wfx.root, dfn[x] + 1, dfn[y], d), cdy.chenge(cdy.root, dfn[x] + 1, dfn[y], d);

}

int ask(int k) {

	if(siz[k] <= 1) return 0;

	int a = wfx.ask(wfx.root, dfn[k] + 1, dfn[k] + siz[k] - 1), b = cdy.ask(cdy.root, dfn[k] + 1, dfn[k] + siz[k] - 1);

	return ((siz[k] * a - b) % p + p) % p;

}

int main()

{

	#ifdef yilnr

	#else

	freopen("network.in","r",stdin);

	freopen("network.out","w",stdout);

	#endif

	int n = read(), m = read();

	for(int i = 2; i <= n; ++i) {

		int x = read(); a[i] = read();

		head[x] = new Edge (i, head[x]);

	}

	dfs(1, 0);

	dfs(1, 0, 1);

	wfx.bulid(wfx.root, 1, n, false);

	cdy.bulid(cdy.root, 1, n, true);

	for(; m --> 0; ) {

		int opt = getc(), l, r, d;

		if(opt) l = read(), r = read(), d = read(), chenge(l, r, d);

		else printf("%d\n", ask(read()));

	}

	return 0;

}