/**
 * Author: Sergey Kopeliovich (Burunduk30@gmail.com)
 */

#include <bits/stdc++.h>

using namespace std;

#define forn(i, n) for (int i = 0; i < (int)(n); i++)
#define pb push_back
#define sz(a) (int)(a).size()

typedef long long ll;

const int N = 1e5, M = 300;
int n, m, q, a, b;
vector<int> c[N], g[N];
ll add[N], res[N];

int main() {
	ios_base::sync_with_stdio(0), cin.tie(0);
	cin >> n >> m;
	while (m--) {
		cin >> a >> b, a--, b--;
		c[a].pb(b), c[b].pb(a);
	}
	forn(a, n)
		if (sz(c[a]) > M)
			for (int x : c[a])
				g[x].pb(a);
	cin >> q;
	while (q--) {
		int type;
		cin >> type;
		if (!type) {
			cin >> a >> b, a--;
			if (sz(c[a]) <= M)
				for (int x : c[a])
					res[x] += b;
			else
				add[a] += b;
		} else {
			cin >> a, a--;
			ll ans = res[a];
			for (int x : g[a])
				ans += add[x];
			cout << ans << "\n";
		}
	}
	return 0;
}