#include <bits/stdc++.h>
using namespace std;
int n, m;
std::vector<int> adj[5001];
int edges[5001][5001];
std::vector<pair<int, int>> edges1;
int depth[5001], par[5001];
void dfs(int v, int p, int d) {
  depth[v] = d;
  par[v] = p;
  for (auto c : adj[v])
    if (c != p) dfs(c, v, d + 1);
}
vector<int> getpath(int a, int b) {
  vector<int> ans, path1, path2;
  path1.push_back(a);
  path2.push_back(b);
  while (a != b) {
    if (depth[a] < depth[b])
      path2.push_back(b = par[b]);
    else if (depth[a] > depth[b])
      path1.push_back(a = par[a]);
    else if (depth[a] == depth[b])
      path1.push_back(a = par[a]), path2.push_back(b = par[b]);
  }
  reverse(path2.begin(), path2.end());
  path2.erase(path2.begin());
  path1.insert(path1.end(), path2.begin(), path2.end());
  return ans = path1;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> n;
  for (int i = 0; i < n - 1; i++) {
    int x, y;
    cin >> x >> y;
    adj[x].push_back(y);
    adj[y].push_back(x);
    edges[x][y] = 1000000;
    edges[y][x] = 1000000;
    edges1.push_back({x, y});
  }
  dfs(1, -1, 0);
  std::vector<pair<int, pair<int, int>>> v;
  cin >> m;
  while (m--) {
    int x, y, z;
    cin >> x >> y >> z;
    v.push_back({z, {x, y}});
  }
  sort((v).begin(), (v).end());
  int fl = 0;
  for (auto i : v) {
    int w = i.first;
    int n1 = i.second.first;
    int n2 = i.second.second;
    std::vector<int> p = getpath(n1, n2);
    for (int j = 0; j < p.size() - 1; j++) {
      edges[p[j]][p[j + 1]] = w;
      edges[p[j + 1]][p[j]] = w;
    }
  }
  for (auto i : v) {
    int w = i.first;
    int n1 = i.second.first;
    int n2 = i.second.second;
    std::vector<int> p = getpath(n1, n2);
    int tt = 1e7;
    for (int j = 0; j < p.size() - 1; j++) {
      tt = min(tt, min(edges[p[j]][p[j + 1]], edges[p[j + 1]][p[j]]));
    }
    if (tt != w) {
      fl = 1;
      break;
    }
  }
  if (fl) {
    cout << "-1";
    exit(0);
  }
  for (auto i : edges1) {
    cout << edges[i.first][i.second] << " ";
  }
}
