//---------- begin union_find ---------- #[allow(dead_code)] mod union_find { pub struct UF { p: Vec, } impl UF { pub fn new(n: usize) -> UF { UF {p: vec![-1; n] } } pub fn init(&mut self) { for p in self.p.iter_mut() { *p = -1; } } pub fn root(&self, mut x: usize) -> usize { while self.p[x] >= 0 { x = self.p[x] as usize; } x } pub fn same(&self, x: usize, y: usize) -> bool { self.root(x) == self.root(y) } pub fn unite(&mut self, mut x: usize, mut y: usize) -> Option<(usize, usize)> { x = self.root(x); y = self.root(y); if x == y { return None; } if self.p[x] > self.p[y] { let s = x; x = y; y = s; } self.p[x] += self.p[y]; self.p[y] = x as i32; Some((x, y)) } pub fn parent(&self, x: usize) -> Option { let p = self.p[x]; if p >= 0 { Some(p as usize) } else { None } } pub fn get_size(&self, x: usize) -> usize { let r = self.root(x); (-self.p[r]) as usize } } } //---------- end union_find ---------- //https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8 より macro_rules! input { (source = $s:expr, $($r:tt)*) => { let mut iter = $s.split_whitespace(); input_inner!{iter, $($r)*} }; ($($r:tt)*) => { let s = { use std::io::Read; let mut s = String::new(); std::io::stdin().read_to_string(&mut s).unwrap(); s }; let mut iter = s.split_whitespace(); input_inner!{iter, $($r)*} }; } macro_rules! input_inner { ($iter:expr) => {}; ($iter:expr, ) => {}; ($iter:expr, $var:ident : $t:tt $($r:tt)*) => { let $var = read_value!($iter, $t); input_inner!{$iter $($r)*} }; } macro_rules! read_value { ($iter:expr, ( $($t:tt),* )) => { ( $(read_value!($iter, $t)),* ) }; ($iter:expr, [ $t:tt ; $len:expr ]) => { (0..$len).map(|_| read_value!($iter, $t)).collect::>() }; ($iter:expr, chars) => { read_value!($iter, String).chars().collect::>() }; ($iter:expr, usize1) => { read_value!($iter, usize) - 1 }; ($iter:expr, $t:ty) => { $iter.next().unwrap().parse::<$t>().expect("Parse error") }; } // use std::io::Write; fn run() { let out = std::io::stdout(); let mut out = std::io::BufWriter::new(out.lock()); input! { n: usize, q: usize, ask: [(u8, usize1, i32); q], } let mut sum = vec![0i32; n]; let mut u = union_find::UF::new(n); for (t, a, b) in ask { match t { 1 => { let b = b as usize - 1; if let Some((a, b)) = u.unite(a, b) { sum[b] -= sum[a]; } }, 2 => { sum[u.root(a)] += b; }, _ => { let mut ans = sum[a]; let mut x = a; while let Some(p) = u.parent(x) { x = p; ans += sum[x]; } writeln!(out, "{}", ans).ok(); }, } } } fn main() { run(); }