#include <bits/stdc++.h>
#pragma GCC optimize(2)
#define ll long long
#define i128 __int128
using namespace std;
int n, m, t, l[100005], a[100005], r[100005], b[350][100005], op, name[100005], gl[350], gr[350];
ll suml[100005], sumr[100005], ssum[350];
i128 sum[350], ans;
inline ll gets(int p, int q) {
	ll cnt = 0;
	if (name[p] == name[q]) {
		cnt = sumr[p];
		if (q != gr[name[p]]) {
			cnt -= sumr[q + 1];
		}
		return cnt;
	}
	if (name[p] == name[q] - 1) {
		return sumr[p] + suml[q];
	}
	return sumr[p] + suml[q] + ssum[name[q] - 1] - ssum[name[p]];
}
template<typename type>
inline void read(type &x) {
	x = 0;
	bool flag(0);
	char ch = getchar();
	while (!isdigit(ch)) flag = ch == '-', ch = getchar();
	while (isdigit(ch)) x = (x << 1) + (x << 3) + (ch ^ 48), ch = getchar();
	flag ? x = -x : 0;
}
template<typename type>
inline void write(type x, bool mode = 1) {
	x < 0 ? x = -x, putchar('-') : 0;
	static short Stack[50], top(0);
	do Stack[++top] = x % 10, x /= 10;
	while (x);
	while (top) putchar(Stack[top--] | 48);
	mode ? putchar('\n') : putchar(' ');
}
signed main() {
	read(n);
	t = min(n, (int)sqrt(n) + 1);
	for (int i = 1; i <= n; i++) {
		read(a[i]);
		name[i] = (i - 1) / t + 1;
		ssum[name[i]] += a[i];
	}
	op = name[n];
	for (int i = 1; i <= op; i++) {
		ssum[i] += ssum[i - 1];
		gl[i] = (i - 1) * t + 1, gr[i] = min(n, i * t);
	}
	for (int i = 1; i <= op; i++) {
		for (int j = gl[i]; j <= gr[i]; j++) {
			if (j == gl[i]) {
				suml[j] = a[j];
			} else {
				suml[j] = suml[j - 1] + a[j];
			}
		}
		for (int j = gr[i]; j >= gl[i]; j--) {
			if (j == gr[i]) {
				sumr[j] = a[j];
			} else {
				sumr[j] = sumr[j + 1] + a[j];
			}
		}
	}
	for (int i = 1; i <= n; i++) {
		read(l[i]), read(r[i]);
		b[name[i]][l[i]]++;
		b[name[i]][r[i] + 1]--;
		sum[name[i]] += gets(l[i], r[i]);
	}
	for (int i = 1; i <= op; i++) {
		for (int j = 1; j <= n; j++) {
			b[i][j] += b[i][j - 1];
		}
	}
	int qwe, p, q, w;
	read(m);
	for (int i = 1; i <= m; i++) {
		read(qwe), read(p), read(q);
		if (qwe == 1) {
			w = q - a[p];
			a[p] = q;
			for (int j = name[p]; j <= op; j++) {
				ssum[j] += w;
			}
			for (int j = p; j <= gr[name[p]]; j++) {
				suml[j] += w;
			}
			for (int j = gl[name[p]]; j <= p; j++) {
				sumr[j] += w;
			}
			for (int j = 1; j <= op; j++) {
				sum[j] += 1ll * b[j][p] * w;
			}
		} else {
			ans = 0;
			if (name[p] == name[q]) {
				for (int i = p; i <= q; i++) {
					ans += gets(l[i], r[i]);
				}
			} else {
				for (int i = name[p] + 1; i < name[q]; i++) {
					ans += sum[i];
				}
				for (int i = p; i <= gr[name[p]]; i++) {
					ans += gets(l[i], r[i]);
				}
				for (int i = q; i >= gl[name[q]]; i--) {
					ans += gets(l[i], r[i]);
				}
			}
			write(ans, 1);
		}
	}
}