#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
// #include<ext/pb_ds/assoc_container.hpp>
// #include<ext/pb_ds/tree_policy.hpp>
// #include<ext/pb_ds/tag_and_trait.hpp>
// using namespace __gnu_pbds;
// #include<boost/multiprecision/cpp_int.hpp>
// namespace multiprecisioninteger = boost::multiprecision;
// using cint=multiprecisioninteger::cpp_int;
using namespace std;
using ll=long long;
#define double long double
using datas=pair<ll,ll>;
using ddatas=pair<double,double>;
using tdata=pair<ll,datas>;
using vec=vector<ll>;
using mat=vector<vec>;
using pvec=vector<datas>;
using pmat=vector<pvec>;
// using llset=tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>;
#define For(i,a,b) for(i=a;i<(ll)b;++i)
#define bFor(i,b,a) for(i=b,--i;i>=(ll)a;--i)
#define rep(i,N) For(i,0,N)
#define rep1(i,N) For(i,1,N)
#define brep(i,N) bFor(i,N,0)
#define brep1(i,N) bFor(i,N,1)
#define all(v) (v).begin(),(v).end()
#define allr(v) (v).rbegin(),(v).rend()
#define vsort(v) sort(all(v))
#define vrsort(v) sort(allr(v))
#define endl "\n"
#define eb emplace_back
#define print(v) cout<<v<<endl
#define printyes cout<<"Yes"<<endl
#define printno cout<<"No"<<endl
#define printYES cout<<"YES"<<endl
#define printNO cout<<"NO"<<endl
#define output(v) do{bool f=0;for(auto outi:v){cout<<(f?" ":"")<<outi;f=1;}cout<<endl;}while(0)
#define matoutput(v) do{for(auto outimat:v)output(outimat);}while(0)
const ll mod=1000000007;
// const ll mod=998244353;
const ll inf=1LL<<60;
const double PI = acos(-1);
const double eps = 1e-9;
template<class T> inline bool chmax(T& a,T b){bool x=a<b;if(x)a=b;return x;} 
template<class T> inline bool chmin(T& a,T b){bool x=a>b;if(x)a=b;return x;} 

struct unionfind{
  private:
  int maxN;
  vector<int> par;
  public:unionfind(int N) :maxN(N),par(N){
    for(int i=0;i<maxN;++i)par[i]=i;
  }
  int root(int x){
    while(par[x]!=x){
      x=par[x]=par[par[x]];
    }
    return x;
  }
  bool unite(int x,int y){
    int px=root(x);
    int py=root(y);
    par[px]=py;
    return px!=py;
  }
  bool parcheck(int x,int y){
    return root(x)==root(y);
  }
  void clear(){
    int i;
    for(i=0;i<maxN;++i){
      par[i]=i;
    }
  }
};

struct BinaryIndexedTree{
  int size;
  vector<int> tree;
  BinaryIndexedTree(int N):size(N+1),tree(size,0){}
  void act(int i,int x){
    assert(i>=0);
    assert(i<size-1);
    for(++i;i<size;i+=-i&i){
      tree[i]+=x;
    }
  }
  int queli(int i){
    assert(i>=0);
    assert(i<size-1);
    int res=0;
    for(++i;i>0;i-=-i&i){
      res+=tree[i];
    }
    return res;
  }
};
int N;
vector<vector<int>> g;
vector<pair<int,int>> pos;
int euler_tour(int now,int cnt){
  pos[now].first=cnt;
  cnt++;
  for(int x:g[now]){
    cnt=euler_tour(x,cnt);
  }
  return pos[now].second=cnt;
}
int main(){
  int i,Q,a,b,cnt=0;
  scanf("%d %d",&N,&Q);
  g.resize(N*2-1);
  pos.resize(N*2-1);
  unionfind tree(N*2-1);
  vector<pair<int,pair<int,int>>> queli;
  while(Q--){
    scanf("%d %d %d",&i,&a,&b);
    --a;
    if(i==1){
      --b;
      a=tree.root(a);
      b=tree.root(b);
      if(a!=b){
        queli.eb(1,pair<int,int>(a,cnt+N));
        queli.eb(1,pair<int,int>(b,cnt+N));
        g[cnt+N].eb(a);
        g[cnt+N].eb(b);
        tree.unite(a,cnt+N);
        tree.unite(b,cnt+N);
        ++cnt;
      }
    }else{
      queli.eb(i,pair<int,int>(a,b));
    }
  }
  if(cnt==0){
    vector<int> v(N,0);
    for(auto x:queli){
      if(x.first==2){
        v[x.second.first]+=x.second.second;
      }else{
        printf("%d\n",v[x.second.first]);
      }
    }
    return 0;
  }
  i=1;
  while(cnt<N-1){
    a=tree.root(0);
    while(tree.root(i)==a)++i;
    b=tree.root(i);
    g[cnt+N].eb(a);
    g[cnt+N].eb(b);
    tree.unite(a,cnt+N);
    tree.unite(b,cnt+N);
    ++cnt;
  }
  tree.clear();
  euler_tour(N*2-2,0);
  BinaryIndexedTree v(N*4);
  for(auto x:queli){
    if(x.first==1){
      tree.unite(x.second.first,x.second.second);
    }else if(x.first==2){
      a=tree.root(x.second.first);
      v.act(pos[a].first,x.second.second);
      v.act(pos[a].second,-x.second.second);
    }else{
      printf("%d\n",v.queli(pos[x.second.first].first));
    }
  }
}