#include<cstdio>
#include<queue>
#include<cstdlib>
#include<cstring>
#include<algorithm>
using namespace std;
const int N = 505;
const int M = 2017;
const int INF = 1e9;
struct Edge {
int v, nxt, w;
}edge[M];
struct node {
int u, v, w;
}data[M];
int first[N], top, p;
int d[N], d2[N], fa[N], fa2[N];
bool vis[N];
struct cmp {
bool operator () (const int a, const int b) {
if(d[a] < d[b]) return false;
return true;
}
};
void add(int u, int v, int w) {
edge[++top].nxt = first[u];
first[u] = top;
edge[top].v = v;
edge[top].w = w;
}
void init() {
memset(first, -1, sizeof(first));
memset(fa, 0, sizeof(fa));
memset(fa2, 0, sizeof(fa2));
top = p = 0;
}
void dijkstra(int n, int s, int t) {
priority_queue<int, vector<int>, cmp> que;
memset(vis, false, sizeof(vis));
for(int i = 1; i <= n; i++) d[i] = INF;
d[s] = 0;
que.push(s);
while(!que.empty()) {
int x = que.top();
que.pop();
if(vis[x]) continue;
vis[x] = 1;
for(int i = first[x]; i != -1; i = edge[i].nxt) {
int v = edge[i].v;
if(vis[v]) continue;
if(d[v] >= d[x] + edge[i].w) {
d[v] = d[x] + edge[i].w;
fa[v] = x;
}
que.push(v);
}
}
memset(vis, false, sizeof(vis));
for(int i = 1; i <= n; i++) d2[i] = INF;
d2[t] = 0;
que.push(t);
while(!que.empty()) {
int x = que.top();
que.pop();
if(vis[x]) continue;
vis[x] = 1;
for(int i = first[x]; i != -1; i = edge[i].nxt) {
int v = edge[i].v;
if(vis[v]) continue;
if(d2[v] >= d2[x] + edge[i].w) {
d2[v] = d2[x] + edge[i].w;
fa2[v] = x;
}
que.push(v);
}
}
}
void out(int pos) {
if(pos == 0) return;
out(fa[pos]);
printf("%d ", pos);
}
void out2(int pos, int s) {
if(pos == 0) return;
if(pos != s) printf(" ");
printf("%d", pos);
out2(fa2[pos], s);
}
int main() {
int n, s, e;
while(scanf("%d %d %d", &n, &s, &e) == 3) {
init();
int m, k;
int u, v, w;
scanf("%d", &m);
for(int i = 1; i <= m; i++) {
scanf("%d %d %d", &u, &v, &w);
add(u, v, w);
add(v, u, w);
}
scanf("%d", &k);
for(int i = 1; i <= k ; i++) {
scanf("%d %d %d", &u, &v, &w);
data[++p].u = u;
data[p].v = v;
data[p].w = w;
}
dijkstra(n, s, e);
int ans = 1e9, num, vv;
for(int i = 1; i <= k; i++) {
if(data[i].u != e && d[data[i].u] + d2[data[i].v] + data[i].w < ans) {
ans = d[data[i].u] + d2[data[i].v] + data[i].w;
num = data[i].u;
vv = data[i].v;
} else if(data[i].v != e && d2[data[i].u] + d[data[i].v] + data[i].w < ans) {
ans = d2[data[i].u] + d[data[i].v] + data[i].w;
num = data[i].v;
vv = data[i].u;
}
}
if(ans >= d[e]) {
ans = d[e];
num = e;
}
out(fa[num]);
if(num != e) printf("%d ", num);
out2(vv, vv);
printf("\n");
if(num != e) {
printf("%d\n", num);
} else {
printf("Ticket Not Used\n");
}
printf("%d\n\n", ans);
}
return 0;
}