#include<bits/stdc++.h>
namespace ZDY{
    #pragma GCC optimize(3)
    #define il __inline__ __attribute__ ((always_inline))
    #define rg register
    #define ll long long
    #define ull unsigned long long
    #define db double
    #define sht short
    #define MB template <class T>il
    #define Fur(i,x,y) for(int i=x;i<=y;i++)
    #define Fdr(i,x,y) for(int i=x;i>=y;i--)
    #define fl(i,x) for(int i=head[x],to;to=e[i].to,i;i=e[i].nxt)
    #define clr(x,y) memset(x,y,sizeof(x))
    #define cpy(x,y) memcpy(x,y,sizeof(x))
    #define fin(s) freopen(s".in","r",stdin)
    #define fout(s) freopen(s".out","w",stdout)
    #define fcin ios::sync_with_stdio(false)
    #define l2(n) ((int)(log2(n)))
    #define inf 0x3f3f3f3f
    MB T ABS(T x){return x>0?x:-x;}
    MB T MAX(T x,T y){return x>y?x:y;}
    MB T MIN(T x,T y){return x<y?x:y;}
    MB T GCD(T x,T y){return y?GCD(y,x%y):x;}
    MB void SWAP(T &x,T &y){T t=x;x=y;y=t;}
}using namespace ZDY;using namespace std;
namespace IO{const char* ln="\n";const int str=1<<20;struct IN{char buf[str],*s,*t;bool _;IN():s(buf),t(buf),_(0){}il char gc(){return s==t&&((t=(s=buf)+fread(buf,1,str,stdin))==s)?EOF:(*s++);}IN&operator>>(char&ch){if(_)return *this;char c;while((c=gc())!=EOF&&isspace(c));if(c==EOF)_=1;else ch=c;return *this;}IN& operator>>(char* ch){clr(ch,0);if(_)return *this;char c;while((c=gc())!=EOF&&isspace(c));if(c==EOF)return _=1,*this;*ch=c;ch++;while((c=gc())!=EOF&&!isspace(c))*ch=c,ch++;if(c==EOF)_=1;return *this;}IN& operator>>(string& ch){if(_)return *this;char c;while((c=gc())!=EOF&&isspace(c));if(c==EOF)return _=1,*this;ch+=c;while((c=gc())!=EOF&&!isspace(c))ch+=c;if(c==EOF)_=1;return *this;}template<typename T>IN&operator>>(T&x){if(_)return *this;char c=gc();bool ff=0;while(c!=EOF&&(c<'0'||c>'9'))ff^=(c=='-'),c=gc();if(c==EOF){_=1;return *this;}x=0;while(c!=EOF&&'0'<=c&&c<='9')x=(x<<3)+(x<<1)+c-48,c=gc();if(c==EOF)_=1;if(ff)x=-x;return *this;}}in;struct OUT{char buf[str],*s,*t;OUT():s(buf),t(buf+str){}~OUT(){fwrite(buf,1,s-buf,stdout);}void pt(char c){(s==t)?(fwrite(s=buf,1,str,stdout),*s++=c):(*s++=c);}OUT&operator<<(const char*s){while(*s)pt(*s++);return *this;}OUT&operator<<(char*s){while(*s)pt(*s++);return *this;}OUT&operator<<(string s){for(int i=0;s[i];i++)pt(s[i]);return *this;}template<typename T>OUT&operator<<(T x){if(!x)return pt('0'),*this;if(x<0)pt('-'),x=-x;char a[30],t=0;while(x)a[t++]=x%10,x/=10;while(t--)pt(a[t]+'0');return *this;}}out;}using namespace IO;
#define N 3333
#define int ll
int n,m,L;
struct edge{
    int to,nxt,w;
}e[N*N*2];
int head[N],cnt=0;
void add(int x,int y,int w){
    e[++cnt].to=y;e[cnt].w=w;e[cnt].nxt=head[x];head[x]=cnt;
}
int f[N][N],d[N],g[N];
struct cmp{
    bool operator()(int x,int y){
        if(d[x]>d[y])return 1;
        else if(d[x]==d[y]&&g[x]<d[y])return 1;
        else return 0;
    }
};
bool v[N];
priority_queue<int,vector<int>,cmp>q;
void dij(int x){
    int tt=x;
    while(!q.empty())q.pop();
    clr(d,126);clr(g,0);clr(v,0);
    d[x]=0;g[x]=L;v[x]=1;
    q.push(x);
    while(!q.empty()){
        x=q.top();q.pop();v[x]=0;
        fl(i,x)
        if(L>=e[i].w){
            int tmp=d[x]+!(g[x]>=e[i].w),t=((g[x]>=e[i].w)?(g[x]-e[i].w):(L-e[i].w));
            if(tmp<d[to]||(tmp==d[to]&&t>g[to])){
                d[to]=tmp; 
                g[to]=t;
                if(!v[to])q.push(to),v[to]=1;
            }
        }
    }
    Fur(i,1,n)f[tt][i]=((d[i]==9114861777597660798)?-1:d[i]);
}
signed main(){
    in>>n>>m>>L;
    int x,y,w;
    Fur(i,1,m){
        in>>x>>y>>w;
        if(L>=w)add(x,y,w),add(y,x,w);
    }
    Fur(i,1,n)dij(i);
    int q;in>>q;
    while(q--){
        in>>x>>y;
        out<<f[x][y]<<ln;
    }
}

Measured memory_bytes: 14336