#include<bits/stdc++.h>
#define N 300005
#define re 
#define ll long long
#define P 167772161
using namespace std;
int n,m,K,q;
inline void Rd(int &res){
	re char c;res=0;
	while(c=getchar(),c<48);
	do res=(res<<3)+(res<<1)+(c^48);
	while(c=getchar(),c>47);
}
int a[N];
ll ans[N];
int cnt0;
struct Edge{
	int x,y,id;
}E[N],Q[N],A[N];
bool cmp(Edge a,Edge b){return a.y>b.y;}


int f[N],son[N][2],val[N],sum[N],tmp[N];
bool rev[N];
bool isroot(int x){return !f[x]||(son[f[x]][0]!=x&&son[f[x]][1]!=x);}
void rev1(int x){if(!x)return;swap(son[x][0],son[x][1]);rev[x]^=1;}
void pb(int x){if(rev[x])rev1(son[x][0]),rev1(son[x][1]),rev[x]=0;}
void up(int x){
	sum[x]=val[x];
	if(son[x][0])sum[x]+=sum[son[x][0]];
	if(son[x][1])sum[x]+=sum[son[x][1]];
}
void rotate(int x){
	cnt0++;
	int y=f[x],w=son[y][1]==x;
	son[y][w]=son[x][w^1];
	if(son[x][w^1])f[son[x][w^1]]=y;
	if(f[y]){
		int z=f[y];
		if(son[z][0]==y)son[z][0]=x;else if(son[z][1]==y)son[z][1]=x;
	}
	f[x]=f[y];f[y]=x;son[x][w^1]=y;up(y);
}
void splay(int x){
//	printf("splay:%d\n",x);
	int s=1,i=x,y;tmp[1]=i;
	while(!isroot(i))tmp[++s]=i=f[i];
	while(s)pb(tmp[s--]);
	while(!isroot(x)){
		y=f[x];
		if(!isroot(y)){if((son[f[y]][0]==y)^(son[y][0]==x))rotate(x);else rotate(y);}
		rotate(x);
	}
	up(x);
}
void access(int x){for(int y=0;x;y=x,x=f[x])splay(x),son[x][1]=y,up(x);}
int root(int x){access(x);splay(x);while(son[x][0])x=son[x][0];return x;}
void makeroot(int x){access(x);splay(x);rev1(x);}
void link(int x,int y){makeroot(x);f[x]=y;access(x);}
void cutf(int x){access(x);splay(x);f[son[x][0]]=0;son[x][0]=0;up(x);}
void cut(int x,int y){makeroot(x);cutf(y);}
int ask(int x,int y){makeroot(x);access(y);splay(y);return sum[y];}
void push(int x){
	if(rev[x]){
		rev[son[x][0]]^=1;
		rev[son[x][1]]^=1;
		swap(son[x][0],son[x][1]);
		rev[x]=0;
	}
}
bool isconnect(int x,int y){
	return root(x)==root(y);
//	makeroot(x);
//	access(y);
//	while(push(y),son[y][0])y=son[y][0];
//	splay(y);
//	return x==y;
}
void Solve(){
	int t=1;
	for(re int i=1;i<=m;i++){
		while(t<=m&&!isconnect(E[t].x,E[t].y)){
			link(E[t].x,E[t].y);
			t++;
		}
		A[i]=(Edge){i,t-1,0};
		if(t<=m)cut(E[i].x,E[i].y);
	}
}
struct BIT{
	ll tree[N];
	inline void add(int x,int v){while(x<=m)tree[x]+=v,x+=x&-x;}
	ll query(int x){
		ll res=0;
		while(x)res+=tree[x],x-=x&-x;
		return res;
	}
}T[2];
int main(){
	Rd(n),Rd(m);
//	n=10000,m=60000;
	for(re int i=1;i<=m;i++){
//		int t=i%10000;
//		if(t==0)E[i].x=10000,E[i].y=1;
//		else E[i].x=t,E[i].y=t+1;
		Rd(E[i].x),Rd(E[i].y);
	}
	
	Solve();
//	cerr<<"cnt0="<<cnt0<<endl;
//	return 0;
	Rd(q);
	for(re int i=1;i<=q;i++){
		Rd(Q[i].x),Rd(Q[i].y);
		Q[i].id=i;
	}
	sort(Q+1,Q+q+1,cmp);
	sort(A+1,A+m+1,cmp);
	int t1=1,t2=1;
	for(re int i=1;i<=m;i++){
		T[0].add(A[i].x,A[i].y);
	}
	for(re int r=m;r>=1;r--){
		while(t2<=m&&A[t2].y==r){
			T[0].add(A[t2].x,-A[t2].y);
			T[1].add(A[t2].x,1);
			t2++;
		}
		while(t1<=q&&Q[t1].y==r){
			ll res=T[0].query(Q[t1].y)-T[0].query(Q[t1].x-1);
			res+=1ll*r*(T[1].query(Q[t1].y)-T[1].query(Q[t1].x-1));
			res-=1ll*(Q[t1].x+Q[t1].y)*(Q[t1].y-Q[t1].x+1)/2;
			res+=1ll*(Q[t1].y-Q[t1].x+1);
			ans[Q[t1].id]=res;
			t1++;
		}
	}
	for(re int i=1;i<=q;i++){
		printf("%lld\n",ans[i]);
	}
	
	
	return 0;
}