#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")

////////////////////////////////////////////////////////////////////////////////
template <unsigned M_> struct ModInt {
  static constexpr unsigned M = M_;
  unsigned x;
  constexpr ModInt() : x(0U) {}
  constexpr ModInt(unsigned x_) : x(x_ % M) {}
  constexpr ModInt(unsigned long long x_) : x(x_ % M) {}
  constexpr ModInt(int x_) : x(((x_ %= static_cast<int>(M)) < 0) ? (x_ + static_cast<int>(M)) : x_) {}
  constexpr ModInt(long long x_) : x(((x_ %= static_cast<long long>(M)) < 0) ? (x_ + static_cast<long long>(M)) : x_) {}
  ModInt &operator+=(const ModInt &a) { x = ((x += a.x) >= M) ? (x - M) : x; return *this; }
  ModInt &operator-=(const ModInt &a) { x = ((x -= a.x) >= M) ? (x + M) : x; return *this; }
  ModInt &operator*=(const ModInt &a) { x = (static_cast<unsigned long long>(x) * a.x) % M; return *this; }
  ModInt &operator/=(const ModInt &a) { return (*this *= a.inv()); }
  ModInt pow(long long e) const {
    if (e < 0) return inv().pow(-e);
    ModInt a = *this, b = 1U; for (; e; e >>= 1) { if (e & 1) b *= a; a *= a; } return b;
  }
  ModInt inv() const {
    unsigned a = M, b = x; int y = 0, z = 1;
    for (; b; ) { const unsigned q = a / b; const unsigned c = a - q * b; a = b; b = c; const int w = y - static_cast<int>(q) * z; y = z; z = w; }
    assert(a == 1U); return ModInt(y);
  }
  ModInt operator+() const { return *this; }
  ModInt operator-() const { ModInt a; a.x = x ? (M - x) : 0U; return a; }
  ModInt operator+(const ModInt &a) const { return (ModInt(*this) += a); }
  ModInt operator-(const ModInt &a) const { return (ModInt(*this) -= a); }
  ModInt operator*(const ModInt &a) const { return (ModInt(*this) *= a); }
  ModInt operator/(const ModInt &a) const { return (ModInt(*this) /= a); }
  template <class T> friend ModInt operator+(T a, const ModInt &b) { return (ModInt(a) += b); }
  template <class T> friend ModInt operator-(T a, const ModInt &b) { return (ModInt(a) -= b); }
  template <class T> friend ModInt operator*(T a, const ModInt &b) { return (ModInt(a) *= b); }
  template <class T> friend ModInt operator/(T a, const ModInt &b) { return (ModInt(a) /= b); }
  explicit operator bool() const { return x; }
  bool operator==(const ModInt &a) const { return (x == a.x); }
  bool operator!=(const ModInt &a) const { return (x != a.x); }
  friend std::ostream &operator<<(std::ostream &os, const ModInt &a) { return os << a.x; }
};
////////////////////////////////////////////////////////////////////////////////

constexpr unsigned MO = 1315105;
using Mint = ModInt<MO>;


namespace io {
char ch,B0[1<<15],*S=B0,*T=B0;
#define getc() (S==T&&(T=(S=B0)+fread(B0,1,1<<15,stdin),S==T)?0:*S++)
inline int read(){
    int aa;
    while(ch=getc(),ch<'0'||ch>'9');aa=ch-'0';
    while(ch=getc(),ch>='0'&&ch<='9')aa=aa*10+ch-'0';
    return aa;
}
}  // io

int N, M, K;
vector<int> A, B;
vector<Mint> C;

vector<vector<int>> graph;


namespace brute {
Mint run() {
cerr<<"[brute::run]"<<endl;
  Mint ans = 0;
  for (int s = 0; s < N; ++s) {
    queue<int> que;
    vector<int> dist(N, -1);
    dist[s] = 0;
    que.push(s);
    for (; que.size(); ) {
      const int u = que.front();
      que.pop();
      for (const int v : graph[u]) {
        if (!~dist[v]) {
          dist[v] = dist[u] + 1;
          que.push(v);
        }
      }
    }
    Mint sum = 0;
    for (int u = s + 1; u < N; ++u) if (dist[u] == K) {
      sum += C[u];
    }
    ans += C[s] * sum;
  }
  return ans;
}
}  // brute


namespace tree {
Mint ans;
vector<Mint> dfs(int u, int p) {
  vector<Mint> ret{C[u]};
  for (const int v : graph[u]) if (p != v) {
    auto res = dfs(v, u);
    res.push_back(0);
    if (ret.size() < res.size()) {
      ret.swap(res);
    }
    const int a = ret.size();
    const int b = res.size();
    for (int i = 0; i < b; ++i) {
      if (0 <= K - i && K - i < a) {
        ans += ret[a - 1 - (K - i)] * res[b - 1 - i];
      }
    }
    for (int i = 0; i < b; ++i) {
      ret[a - 1 - i] += res[b - 1 - i];
    }
  }
  return ret;
}
Mint run() {
cerr<<"[tree::run]"<<endl;
  ans = 0;
  dfs(0, -1);
  return ans;
}
}  // tree


int main() {
  N = io::read();
  M = io::read();
  K = io::read();
  A.resize(M);
  B.resize(M);
  for (int i = 0; i < M; ++i) {
    A[i] = io::read() - 1;
    B[i] = io::read() - 1;
  }
  C.resize(N);
  {
    const int seed = io::read();
    mt19937_64 rnd(seed);
    // int MAXM=1e9;
    const int MAXM=1e9;
    // for(int i=1;i<=n;i++)a[i]=rnd()%MAXM+1;
    for(int i=1;i<=N;i++)C[i-1]=(Int)(rnd()%MAXM+1);
  }
// cerr<<"C = "<<C<<endl;
  
  graph.assign(N, {});
  for (int i = 0; i < M; ++i) {
    graph[A[i]].push_back(B[i]);
    graph[B[i]].push_back(A[i]);
  }
  
  Mint ans = 0;
  if (M == N - 1) {
    ans = tree::run();
  } else {
    ans = brute::run();
  }
  printf("%u\n", ans.x);
  return 0;
}