#include<bits/stdc++.h>
using namespace std;
int n, m, root, b[500005];
long long x, y, z, c[500005];
map<pair<int, int>, int> ma;
stack<int> st;
inline int get(int p, int q) {
	if (ma.find(make_pair(p, q)) != ma.end()) return ma[make_pair(p, q)];
	if (p > q) swap(p, q);
	return (((p * x + q * y) % z) >= (c[p] + c[q]));
}
inline int calc(int p) {
	return (p - 1) % n + 1;
}
signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin >> n >> m;
	for (int i = 1; i <= m; i++) {
		cin >> x >> y >> z;
		ma[make_pair(x, y)] = ma[make_pair(y, x)] = z;
	}
	cin >> x >> y >> z;
	for (int i = 1; i <= n; i++) {
		cin >> c[i];
	}
	root = 1;
	st.push(1);
	for (int qwe = 0; qwe <= 1; qwe++) {
		for (int i = 2; i <= 4 * n; i++) {
			if (calc(i) == root) {
				for (int j = 1; j <= n; j++) {
					if (j == root) continue;
					cout << j << ' ' << b[j] << "\n";
				}
				return 0;
			}
			bool flg = 0;
			while (st.size()) {
				if (get(st.top(), calc(i)) == qwe) {
					flg = 1;
					break;
				}
				st.pop();
			}
			if (!flg) {
				for (int j = root; j < i; j++) {
					b[calc(i)] = 0;
				}
				root = calc(i);
				st.push(calc(i));
			} else {
				b[calc(i)] = st.top();
				st.push(calc(i));
			}
		}
		memset(b, 0, sizeof(b));
		while (st.size()) {
			st.pop();
		}
		root = 1;
		st.push(1);
	}
	cout << "No solution";
}