#include <bits/stdc++.h>
#include <type_traits>
using namespace std;

using ll=int64_t;
#define int ll

#define FOR(i,a,b) for(int i=int(a);i<int(b);i++)
#define REP(i,b) FOR(i,0,b)
#define MP make_pair
#define PB push_back
#define EB emplace_back
#define ALL(x) x.begin(),x.end()
auto& errStream=cerr;
#ifdef LOCAL
#define cerr (cerr<<"-- line "<<__LINE__<<" -- ")
#else
class CerrDummy{}cerrDummy;
template<class T>
CerrDummy& operator<<(CerrDummy&cd,const T&){
	return cd;
}
using charTDummy=char;
using traitsDummy=char_traits<charTDummy>;
CerrDummy& operator<<(CerrDummy&cd,basic_ostream<charTDummy,traitsDummy>&(basic_ostream<charTDummy,traitsDummy>&)){
	return cd;
}
#define cerr cerrDummy
#endif
#define REACH cerr<<"reached"<<endl
#define DMP(x) cerr<<#x<<":"<<x<<endl
#define ZERO(x) memset(x,0,sizeof(x))
#define ONE(x) memset(x,-1,sizeof(x))

using pi=pair<int,int>;
using vi=vector<int>;
using ld=long double;

template<class T,class U>
ostream& operator<<(ostream& os,const pair<T,U>& p){
	os<<"("<<p.first<<","<<p.second<<")";
	return os;
}

template<class T>
ostream& operator <<(ostream& os,const vector<T>& v){
	os<<"{";
	REP(i,(int)v.size()){
		if(i)os<<",";
		os<<v[i];
	}
	os<<"}";
	return os;
}

ll read(){
	ll i;
	scanf("%"  SCNd64,&i);
	return i;
}

void printSpace(){
	printf(" ");
}

void printEoln(){
	printf("\n");
}

void print(ll x,int suc=1){
	printf("%" PRId64,x);
	if(suc==1)
		printEoln();
	if(suc==2)
		printSpace();
}

string readString(){
	static char buf[3341000];
	scanf("%s",buf);
	return string(buf);
}

char* readCharArray(){
	static char buf[3341000];
	static int bufUsed=0;
	char* ret=buf+bufUsed;
	scanf("%s",ret);
	bufUsed+=strlen(ret)+1;
	return ret;
}

template<class T,class U>
void chmax(T& a,U b){
	if(a<b)
		a=b;
}

template<class T,class U>
void chmin(T& a,U b){
	if(b<a)
		a=b;
}

template<class T>
T Sq(const T& t){
	return t*t;
}

#define CAPITAL
void Yes(bool ex=true){
	#ifdef CAPITAL
	cout<<"YES"<<endl;
	#else
	cout<<"Yes"<<endl;
	#endif
	if(ex)exit(0);
}
void No(bool ex=true){
	#ifdef CAPITAL
	cout<<"NO"<<endl;
	#else
	cout<<"No"<<endl;
	#endif
	if(ex)exit(0);
}

const ll infLL=LLONG_MAX/3;

#ifdef int
const int inf=infLL;
#else
const int inf=INT_MAX/2-100;
#endif

struct Edge{
	int to,cost;
};

const int Nmax=1010;
int x[Nmax];
vector<Edge> tr[Nmax];

int TreeSize(int v,int p){
	int ret=x[v];
	for(auto e:tr[v])if(e.to!=p)
		ret+=TreeSize(e.to,v);
	return ret;
}

int FindCentroid(int v,int p,int s,int&c){
	int ret=x[v],mx=0;
	for(auto e:tr[v])if(e.to!=p){
		int f=FindCentroid(e.to,v,s,c);
		if(f==-1)
			return -1;
		else{
			ret+=f;
			mx=max(mx,f);
		}
	}
	mx=max(mx,s-ret);
	if(mx*2<=s){
		c=v;
		return -1;
	}else
		return ret;
}

int dfs(int v,int p,int d){
	int res=x[v]*d;
	for(auto e:tr[v]){
		if(e.to!=p){
			res+=dfs(e.to,v,d+e.cost);
		}
	}
	return res;
}

void Solve(int root){
	int ts=TreeSize(root,-1);
	if(ts==1){
		print(0);
		return;
	}
	FindCentroid(root,-1,ts,root);
	
	print(dfs(root,-1,0));
}

signed main(){
	int n=read(),q=read();
	REP(i,n)
		x[i]=1;
	assert(n<=1000);
	vector<tuple<int,int,int>> es;
	REP(_,q){
		int t=read();
		if(t==1){
			int a=read()-1,b=read()-1,c=read();
			es.PB(make_tuple(a,b,c));
		}else if(t==2){
			int a=read()-1,b=read()-1;
			auto itr=es.begin();
			while(pi(get<0>(*itr),get<1>(*itr))!=pi(a,b))
				itr++;
			es.erase(itr);
		}else if(t==3){
			int root=read()-1;
			x[root]^=1;
			REP(i,n)
				tr[i].clear();
			for(auto e:es){
				int a=get<0>(e),b=get<1>(e),c=get<2>(e);
				tr[a].PB(Edge{b,c});
				tr[b].PB(Edge{a,c});
			}
			Solve(root);
		}else{
			assert(false);
		}
	}
	
}