// ===================================
// author: M_sea
// website: http://m-sea-blog.com/
// ===================================
#include <algorithm>
#include <iostream>
#include <cstdlib>
#include <cstring>
#include <cstdio>
#include <cmath>
#define re register
using namespace std;
inline int read() {
int X=0,w=1; char c=getchar();
while (c<'0'||c>'9') { if (c=='-') w=-1; c=getchar(); }
while (c>='0'&&c<='9') X=X*10+c-'0',c=getchar();
return X*w;
}
const int N=100000+10;
int f[N],sz[N],sta[N],top=0;
inline int find(int x) { return x==f[x]?x:find(f[x]); }
inline void merge(int x,int y) {
x=find(x),y=find(y);
if (x==y) return;
if (sz[x]>sz[y]) swap(x,y);
f[x]=y,sz[y]+=sz[x],sta[++top]=x;
}
inline void undo(int pos) {
while (top>pos) { int x=sta[top--]; sz[f[x]]-=sz[x],f[x]=x; }
}
int n,m,Q,ans[N];
struct edge { int u,v; } e[N];
struct query { int x,y,z,id; } q[N],lq[N],rq[N];
inline void solve(int l,int r,int ql,int qr) {
if (ql>qr) {
for (re int i=l;i<=r;++i) merge(e[i].u,e[i].v);
return;
}
if (l==r) {
for (re int i=ql;i<=qr;++i) ans[q[i].id]=l;
merge(e[l].u,e[l].v);
return;
}
int mid=(l+r)>>1,tmp=top,ls=0,rs=0;
for (re int i=l;i<=mid;++i) merge(e[i].u,e[i].v);
for (re int i=ql;i<=qr;++i) {
int x=find(q[i].x),y=find(q[i].y);
int s=x==y?sz[x]:sz[x]+sz[y];
if (s>=q[i].z) lq[++ls]=q[i];
else rq[++rs]=q[i];
}
undo(tmp);
for (re int i=1;i<=ls;++i) q[ql+i-1]=lq[i];
for (re int i=1;i<=rs;++i) q[ql+ls+i-1]=rq[i];
solve(l,mid,ql,ql+ls-1),solve(mid+1,r,ql+ls,qr);
}
int main() {
n=read(),m=read();
for (re int i=1;i<=m;++i) e[i].u=read(),e[i].v=read();
Q=read();
for (re int i=1;i<=Q;++i)
q[i].x=read(),q[i].y=read(),q[i].z=read(),q[i].id=i;
for (re int i=1;i<=n;++i) f[i]=i,sz[i]=1;
solve(1,m,1,Q);
for (re int i=1;i<=Q;++i) printf("%d\n",ans[i]);
return 0;
}