#include<bits/stdc++.h>

#define fastio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define ll long long
#define pii pair<int,int>
#define pill pair<int,ll>
#define pll pair<ll,ll>
#define pb push_back
#define fi first
#define se second
#define ff fi.fi
#define fs fi.se
#define sf se.fi
#define ss se.se
#define MASK(x) (((1)<<(x))-1)
#define getbit(x,k) (((x)>>(k))&1)

using namespace std;

const int maxn=1e5+50,mod=1e9+7;
const ll inf=0x3f3f3f3f3f3f3f3f;

int n,m,q,s,t,k;
int d[maxn];
vector<pii>eg[maxn];

bool bfs01(int R)
{
    memset(d,0x3f,sizeof d);d[s]=0;
    deque<int>dQ;
    dQ.push_front(s);
    while(dQ.size())
    {
        int u=dQ.front();dQ.pop_front();
        for(pii v:eg[u])
        {
            int c=(v.se>R);
            if(d[u]+c<d[v.fi])
            {
                d[v.fi]=d[u]+c;
                if(c==0) dQ.push_front(v.fi);
                else dQ.push_back(v.fi);
            }
        }
    }
    return d[t]<=k;
}
int main()
{
    fastio
    cin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        int u,v,c;cin>>u>>v>>c;
        eg[u].pb({v,c});eg[v].pb({u,c});
    }
    cin>>q;
    while(q--)
    {
        cin>>s>>t>>k;
        int l=0,r=1e9,mid,ans=0;
        while(l<=r)
        {
            mid=(l+r)/2;
            if(bfs01(mid)) ans=mid,r=mid-1;
            else l=mid+1;
        }
        cout<<ans<<'\n';
    }
}