#include<cstdio>
#include<vector>
#include<map>
#include<algorithm>
#include<stack>
using namespace std;
vector<int>origin_graph[100010],graph[100010];
int n,m,origin_dfn[100010],low[100010],cnt,scc_cnt,scc[100010],hld_cnt,dfn[100010],dep[100010],top[100010],siz[100010],fa[100010],son[100010],ans[100010];
map<pair<int,int>,bool>bz;
stack<int>s;
struct quests
{
	int opt,x,y;
}q[100010];
struct seg_tree
{
	int num[400010],lazy[400010];
	void pushup(int now)
	{
		num[now]=num[now<<1]+num[now<<1|1];
	}
	void build(int now,int l,int r)
	{
		if(l==r)
		{
			if(l!=1) num[now]=1;
			return;
		}
		int mid=(l+r)>>1;
		build(now<<1,l,mid);
		build(now<<1|1,mid+1,r);
		pushup(now);
	}
	void pushdown(int now)
	{
		if(lazy[now]==0) return;
		lazy[now<<1]=lazy[now<<1|1]=1;
		num[now<<1]=num[now<<1|1]=0;
		lazy[now]=0;
	}
	void change(int now,int l,int r,int x,int y,int k)
	{
		if(r<x||l>y) return;
		if(x<=l&&r<=y)
		{
			num[now]=k;
			lazy[now]=1;
			return;
		}
		pushdown(now);
		int mid=(l+r)>>1;
		if(x<=mid) change(now<<1,l,mid,x,y,k);
		if(y>mid) change(now<<1|1,mid+1,r,x,y,k);
		pushup(now);
	}
	int find(int now,int l,int r,int x,int y)
	{
		if(r<x||l>y) return 0;
		if(x<=l&&r<=y) return num[now];
		pushdown(now);
		int mid=(l+r)>>1,res=0;
		if(x<=mid) res+=find(now<<1,l,mid,x,y);
		if(y>mid) res+=find(now<<1|1,mid+1,r,x,y);
		return res;
	}
}tree;
bool check(int x,int y)
{
	if(x>y) swap(x,y);
	return bz[make_pair(x,y)];
}
void tarjan(int now,int father)
{
	origin_dfn[now]=low[now]=++cnt;
	s.push(now);
	for(auto to:origin_graph[now])
	{
		if(to==father||check(now,to)) continue;
		if(!origin_dfn[to]) tarjan(to,now);
		low[now]=min(low[now],low[to]);
	}
	if(low[now]==origin_dfn[now])
	{
		scc_cnt++;
		int tmp=-1;
		while(tmp!=now)
		{
			tmp=s.top();
			s.pop();
			scc[tmp]=scc_cnt;
		}
	}
}
void dfs1(int now,int father)
{
	fa[now]=father;
	dep[now]=dep[father]+1;
	siz[now]=1;
	for(auto to:graph[now])
	{
		if(to==father) continue;
		dfs1(to,now);
		siz[now]+=siz[to];
		if(siz[to]>siz[son[now]]) son[now]=to;
	}
}
void dfs2(int now,int root)
{
	dfn[now]=++hld_cnt;
	top[now]=root;
	if(son[now])
	{
		dfs2(son[now],root);
		for(auto to:graph[now])
		{
			if(to==fa[now]||to==son[now]) continue;
			dfs2(to,to);
		}
	}
}
void opt_change(int x,int y,int z)
{
	while(top[x]!=top[y])
	{
		if(dep[top[x]]<dep[top[y]]) swap(x,y);
		tree.change(1,1,scc_cnt,dfn[top[x]],dfn[y],z);
		x=fa[top[x]];
	}
	if(dfn[y]<dfn[x]) swap(x,y);
	tree.change(1,1,scc_cnt,dfn[x]+1,dfn[y],z);
}
int opt_find(int x,int y)
{
	int result=0;
	while(top[x]!=top[y])
	{
		if(dep[top[x]]<dep[top[y]]) swap(x,y);
		result+=tree.find(1,1,scc_cnt,dfn[top[x]],dfn[y]);
		x=fa[top[x]];
	}
	if(dfn[y]<dfn[x]) swap(x,y);
	result+=tree.find(1,1,scc_cnt,dfn[x]+1,dfn[y]);
	return result;
}
int main()
{
	scanf("%d%d",&n,&m);
	for(int i=1;i<=m;i++)
	{
		int from,to;
		scanf("%d%d",&from,&to);
		origin_graph[from].push_back(to);
		origin_graph[to].push_back(from);
	}
	int sum_q=0;
	while(1)
	{
		sum_q++;
		scanf("%d",&q[sum_q].opt);
		if(q[sum_q].opt==-1)
		{
			sum_q--;
			break;
		}
		scanf("%d%d",&q[sum_q].x,&q[sum_q].y);
		if(q[sum_q].x>q[sum_q].y) swap(q[sum_q].x,q[sum_q].y);
		if(q[sum_q].opt==0) bz[make_pair(q[sum_q].x,q[sum_q].y)]=1;
	}
	tarjan(1,1);
	for(int i=1;i<=n;i++)
		for(auto j:origin_graph[i])
		{
			if(check(i,j)||scc[i]==scc[j]) continue;
			graph[scc[i]].push_back(scc[j]);
		}
	dfs1(1,1);
	dfs2(1,1);
	tree.build(1,1,scc_cnt);
	for(int i=sum_q;i>=1;i--)
	{
		q[i].x=scc[q[i].x];
		q[i].y=scc[q[i].y];
		if(q[i].opt==0)
			opt_change(q[i].x,q[i].y,0);
		else if(q[i].opt==1)
			ans[i]=(q[i].x==q[i].y?0:opt_find(q[i].x,q[i].y));
	}
	for(int i=1;i<=sum_q;i++)
		if(q[i].opt==1)
			printf("%d\n",ans[i]);
}