#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = (1e+18) + 7;
typedef pair<int, int>P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;
typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-6;
const ld pi = acos(-1.0);
//typedef vector<vector<ll>> mat;
typedef vector<int> vec;

void debug(vector<int> &v) {
	rep(i, v.size()) {
		if (i > 0)cout << " ";
		cout << v[i];
	}
	cout << endl;
}

ll mod_pow(ll a, ll n) {
	ll res = 1;
	while (n) {
		if (n & 1)res = res * a%mod;
		a = a * a%mod; n >>= 1;
	}
	return res;
}

struct modint {
	ll n;
	modint() :n(0) { ; }
	modint(ll m) :n(m) {
		if (n >= mod)n %= mod;
		else if (n < 0)n = (n%mod + mod) % mod;
	}
	operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint &a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint &a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint &a, modint b) { a.n = ((ll)a.n*b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, int n) {
	if (n == 0)return modint(1);
	modint res = (a*a) ^ (n / 2);
	if (n % 2)res = res * a;
	return res;
}

ll inv(ll a, ll p) {
	return (a == 1 ? 1 : (1 - p * inv(p%a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }

const int max_n = 2050;
modint fact[max_n], factinv[max_n];
void init_f() {
	fact[0] = modint(1);
	for (int i = 0; i < max_n - 1; i++) {
		fact[i + 1] = fact[i] * modint(i + 1);
	}
	factinv[max_n - 1] = modint(1) / fact[max_n - 1];
	for (int i = max_n - 2; i >= 0; i--) {
		factinv[i] = factinv[i + 1] * modint(i + 1);
	}
}
modint comb(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[b] * factinv[a - b];
}

struct uf {
private:
	vector<int> par, ran;
public:
	uf(int n) {
		par.resize(n, 0);
		ran.resize(n, 0);
		rep(i, n) {
			par[i] = i;
		}
	}
	int find(int x) {
		if (par[x] == x)return x;
		else return par[x] = find(par[x]);
	}
	void unite(int x, int y) {
		x = find(x), y = find(y);
		if (x == y)return;
		if (ran[x] < ran[y]) {
			par[x] = y;
		}
		else {
			par[y] = x;
			if (ran[x] == ran[y])ran[x]++;
		}
	}
	bool same(int x, int y) {
		return find(x) == find(y);
	}
};


int dx[4] = { 0,1,0,-1 };
int dy[4] = { 1,0,-1,0 };


struct LowLink {
private:
	vector<vector<int>> G;
	vector<int> used, ord, low;
	vector<int> art;
	vector<P> bridge;
public:
	LowLink(int n) {
		G.resize(n);
		used.resize(n, 0);
		ord.resize(n, 0);
		low.resize(n, 0);
	}
	void add_edge(int a, int b) {
		G[a].push_back(b);
		G[b].push_back(a);
	}
	int dfs(int id, int k, int par) {
		used[id] = true;
		ord[id] = k++;
		low[id] = ord[id];
		bool is_art = false;
		int cnt = 0;
		for (auto&& to : G[id]) {
			if (!used[to]) {
				++cnt;
				k = dfs(to, k, id);
				low[id] = min(low[id], low[to]);
				if (~par&&low[to] >= ord[id])is_art = true;
				if (ord[id] < low[to])bridge.emplace_back(minmax(id, to));
			}
			else if (to != par) {
				low[id] = min(low[id], ord[to]);
			}
		}
		if (par == -1 && cnt > 1)is_art = true;
		if (is_art)art.push_back(id);
		return k;
	}
	void complete() {
		int k = 0;
		rep(i, G.size()) {
			if (!used[i]) {
				k = dfs(i, k, -1);
			}
		}
	}
	vector<P> bs() {
		return bridge;
	}
	vector<int> as() {
		return art;
	}
};
struct edge {
	int to, id;
};
vector<edge> G[50];

int gcd(int a, int b) {
	if (a < b)swap(a, b);
	while (b) {
		int r = a % b; a = b; b = r;
	}
	return a;
}
vector<P> es;
void solve() {
	int n, m, k;
	cin >> n >> m >> k;
	vector<modint> prok(n + 1);
	prok[0] = 1;
	rep1(i, n)prok[i] = prok[i - 1] * (modint)k;
	LowLink g(n);
	rep(i, m) {
		int a, b; cin >> a >> b; a--; b--;
		G[a].push_back({ b,i });
		G[b].push_back({ a,i });
		g.add_edge(a, b);

		es.push_back({ a,b });
	}
	g.complete();
	vector<int> ats = g.as();
	vector<bool> isart(n, false);
	for (int id : ats) {
		isart[id] = true;
	}
	uf u(m);
	rep(i, n) {
		if (isart[i]) {
			uf au(n);
			rep(j, n) {
				if (j == i)continue;
				for (edge e : G[j]) {
					if (e.to == i)continue;
					au.unite(j, e.to);
				}
			}
			rep(j, G[i].size()) {
				Rep(k, j + 1, G[i].size()) {
					int l = G[i][j].to;
					int r = G[i][k].to;
					if (au.same(l, r)) {
						u.unite(G[i][j].id, G[i][k].id);
					}
				}
			}
		}
		else {
			rep(j, G[i].size()) {
				Rep(k, j + 1, G[i].size()) {
					u.unite(G[i][j].id, G[i][k].id);
				}
			}
		}
	}
	vector<vector<int>> ids(m);
	rep(i, m) {
		int p = u.find(i);
		ids[p].push_back(i);
	}
	modint ans = 1;

	rep(i, m) {
		if (ids[i].empty())continue;
		vector<bool> exi(n, false);
		rep(j, ids[i].size()) {
			exi[es[ids[i][j]].first] = true;
			exi[es[ids[i][j]].second] = true;
		}
		int cnt = 0;
		rep(j, n)if (exi[j])cnt++;
		int c = ids[i].size();
		if (cnt == ids[i].size()) {
			modint sum = 0;
			rep(j, cnt) {
				int g = gcd(cnt, j);
				sum += prok[g];
			}
			sum = sum / (modint)cnt;
			ans *= sum;
		}
		else {
			modint sum = comb(k - 1 + c, c);
			ans *= sum;
		}
	}

	cout << ans << endl;
}


signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed << setprecision(10);
	init_f(); //init();
	//init();
	//int t; cin >> t; rep(i, t)solve();
	//while(cin>>w>>h,w)solve();
	solve();
	stop
		return 0;
}

Measured memory_bytes: 256