|
Matcom Online Grader
Faculty of Mathematics and Computer Science of University of Havana
ℹ️ We've recently migrated MOG to a new server with a different grader. As a result, some features—especially those related to submission evaluation—might not work correctly. If you encounter any issues, please report them by clicking the exclamation icon in the bottom right corner of the website.
We have an undirected connected simple graph G with $n$ vertices numbered $1$ to $n$ and $m$ edges. Each vertex $i$ has an initial value $W_i$.
You need to perform two types of queries:
- add(v, x): Increase the value for all neighbors of v with +x, such that $1 \leq x \leq 1000$.
- get(v): Print the value of vertex v ($1 \leq v \leq n$).
In a simple graph, the following holds:
- No multi-edges: For each pair of vertices $u$ and $v$, there is no more than one edge connecting $u$ and $v$.
- No self-loops: For each vertex $u$, there is no edge from $u$ to itself.
Input
The first line of input contains the number of vertices $n$ ($1 \leq n \leq 10^5$) and the number of edges $m$ ($1 \leq m \leq 2 \times 10^5$) in graph G. The following line contains $n$ integers $W_i$ ($1 \leq W_i \leq 1000$) separated by whitespace. These are the initial values of the vertices. Each of the following $m$ lines contains two integers $u$ and $v$ ($1 \le u, v \le n$ and $u \neq v$) separated by a whitespace. This corresponds to an edge between vertices $u$ and $v$. The following line contains the number of queries $q$ ($1 \leq q \leq 2 \times 10^5$). The following $q$ lines contain the information of the queries, as it was explained above.
Output
For each query of type $2$, print the value of the vertex $v$ in each case.
Sample test(s)
Input
5 5
1 2 3 4 5
1 2
1 3
1 4
2 4
5 2
6
1 1 3
1 5 1
2 1
2 2
2 3
2 4
Output
1
6
6
7
Input
5 6
1 2 3 4 5
1 2
1 3
1 4
2 4
5 2
5 3
6
1 1 1
2 1
2 2
1 2 3
2 3
2 4
Output
1
3
4
8