3
1 1 5
1 3 42
1 2 42
 2
42 23
1 2 10
 10
45792697 27183921 4791060 77070594 27286110 66957065 19283638 2944837 26775511 65379701
5 8 25
8 10 94
1 4 14
9 7 96
4 2 16
2 6 58
2 3 99
6 8 21
8 9 87
 5
3 1 2 6 5
1 2 3
2 3 1
4 3 9
5 3 1
 10
26 31 21 57 56 44 54 58 79 97
2 1 277
1 8 91
1 7 380
4 1 649
10 5 799
10 1 940
8 6 627
6 3 177
9 6 685
 10
8 100 62 38 26 51 26 23 77 32
6 8 29
4 1 82
7 8 66
7 10 67
8 9 98
6 1 14
1 5 48
3 1 58
2 9 90
 2
23 42
1 2 10
 1
42
 3
1 5 1
1 3 42
1 2 42
 10
1 1 1 1 1 1 1 1 1 1
1 2 5
1 3 5
1 4 5
1 5 5
1 6 5
1 7 5
1 8 5
1 9 5
1 10 5
 3
1 1 1
1 2 42
2 3 42
 3
5 1 1
1 3 42
1 2 24

3 1042.0638260857 1 727.3238618387 6 283959805416.40496826
 3 192.0000000000 1 13952642.4776933547 8 544327.1927847408 2 727.3238618387 1 0.0000000000 2 1042.0638260857 1 100.6230589875 2 544.3822186663 1 389.7666169867
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10;
bool used[N];
int visit[N];
int w[N];
int V;
int t_size[N];
int n;
vector<pair<int, int>> Edge[N];
int total_size;
int c_dfs(int x, int& c) {
  visit[x] = V;
  int m_ch = 0;
  t_size[x] = 1;
  for (auto nx : Edge[x]) {
    int next = nx.first;
    if (!used[next] && visit[next] != V) {
      int ch_size = c_dfs(next, c);
      m_ch = max(m_ch, ch_size);
      t_size[x] += ch_size;
    }
  }
  m_ch = max(m_ch, total_size - t_size[x]);
  if (total_size / 2 >= m_ch) c = x;
  return t_size[x];
}
double d3[N];
double d1[N];
void dfs(int x, int level) {
  visit[x] = V;
  d3[x] = sqrt(level) * level * w[x];
  d1[x] = sqrt(level) * w[x];
  for (auto nx : Edge[x]) {
    int next = nx.first;
    if (visit[next] == V) continue;
    dfs(next, level + nx.second);
    d3[x] += d3[next];
    d1[x] += d1[next];
  }
}
int ans_node;
double solve() {
  int st = 1;
  int c;
  total_size = n;
  double res = 1e100;
  while (!used[st]) {
    V++;
    c_dfs(st, c);
    used[c] = true;
    V++;
    dfs(c, 0);
    if (d3[c] < res) {
      res = d3[c];
      ans_node = c;
    }
    bool flag = true;
    for (auto nx : Edge[c]) {
      int next = nx.first;
      if (used[next]) continue;
      if (d1[c] - 2 * d1[next] < 0) {
        flag = false;
        total_size =
            (t_size[c] > t_size[next]) ? t_size[next] : total_size - t_size[c];
        st = next;
        break;
      }
    }
    if (flag) break;
  }
  return res;
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%d", &w[i]);
  for (int i = 1; i <= n - 1; i++) {
    int a, b, c;
    scanf("%d %d %d", &a, &b, &c);
    Edge[a].push_back(make_pair(b, c));
    Edge[b].push_back(make_pair(a, c));
  }
  double ans = solve();
  printf("%d %.10lf\n", ans_node, ans);
}
