#[allow(unused_imports)]
use std::cmp::{Ordering};

#[allow(unused_imports)]
use std::collections::{BTreeMap, BTreeSet, BinaryHeap, HashMap, HashSet, VecDeque};

#[allow(unused_imports)]
use std::io::{stdin, stdout, BufWriter, Write};

#[allow(unused_imports)]
use std::iter::FromIterator;

#[allow(unused_macros)]
macro_rules! min {
    ($x: expr) => ($x);
    ($x: expr, $($z: expr),+) => {{
        std::cmp::min($x, min!($($z),*))
    }}
}

#[allow(unused_macros)]
macro_rules! max {
    ($x: expr) => ($x);
    ($x: expr, $($z: expr),+) => {{
        std::cmp::max($x, max!($($z),*))
    }}
}

#[allow(unused_macros)]
macro_rules! get { 
    ([$t: ty]) => { 
        { 
            let mut line = String::new(); 
            stdin().read_line(&mut line).unwrap(); 
            line.split_whitespace().map(|t|t.parse::<$t>().unwrap()).collect::<Vec<_>>()
        }
    };
    ([$t: ty];$n: expr) => {
        (0..$n).map(|_|get!([$t])).collect::<Vec<_>>()
    };
    ($t: ty) => {
        {
            let mut line = String::new();
            stdin().read_line(&mut line).unwrap();
            line.trim().parse::<$t>().unwrap()
        }
    };
    ($($t: ty),*) => {
        { 
            let mut line = String::new();
            stdin().read_line(&mut line).unwrap();
            let mut iter = line.split_whitespace();
            ($(iter.next().unwrap().parse::<$t>().unwrap(),)*)
        }
    };
    ($t: ty; $n: expr) => {
        (0..$n).map(|_|get!($t)).collect::<Vec<_>>()
    };
    ($($t: ty),*; $n: expr) => {
        (0..$n).map(|_|get!($($t),*)).collect::<Vec<_>>()
    };
}

#[allow(unused_macros)]
macro_rules! debug {
    ($($a:expr),*) => {
        #[cfg(debug_assertions)]
        writeln!(&mut std::io::stderr(), concat!("[DEBUG] ", $(stringify!($a), "={:?} "),*), $($a),*).unwrap();
    }
}

const BIG_STACK_SIZE: bool = true;

#[allow(dead_code)]
fn main() {
    use std::thread;
    if BIG_STACK_SIZE {
        thread::Builder::new()
            .stack_size(32 * 1024 * 1024)
            .name("solve".into())
            .spawn(solve)
            .unwrap()
            .join()
            .unwrap();
    } else {
        solve();
    }
}

const INF: usize = 1_000_000_000_000_000;

fn solve() {
    let (n,m,l) = get!(usize, usize, usize);
    let abc = get!(usize, usize, usize; m);
    let mut vec = vec![vec![INF; n+1]; n+1];
    for (a,b,c) in abc {
        if c > l {
            continue;
        }
        vec[a][b] = c;
        vec[b][a] = c;
    }
    for i in 1..n+1 {
        vec[i][i] = 0;
    }
    for k in 1..n+1 {
        for i in 1..n+1 {
            for j in 1..n+1 {
                vec[i][j] = min!(vec[i][j], vec[i][k]+vec[k][j]);
            }
        }
    }

    let mut nums = vec![vec![INF; n+1]; n+1];
    for i in 1..n+1 {
        nums[i][i] = 0;
    }
    for i in 1..n+1 {
        for j in 1..n+1 {
            if vec[i][j] <= l {
                nums[i][j] = 1;
            }
        }
    }

    for k in 1..n+1 {
        for i in 1..n+1 {
            for j in 1..n+1 {
                nums[i][j] = min!(nums[i][j], nums[i][k]+nums[k][j]);
            }
        }
    }

    let q = get!(usize);
    for _ in 0..q {
        let (s,t) = get!(usize, usize);
        if nums[s][t] == INF {
            println!("-1");
        } else {
            println!("{}", nums[s][t]-1);
        }
    }
}


Measured memory_bytes: 10748