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>
const int N = 200000;
int read() {
  int x = 0, ch = getchar();
  while (ch < '0' || ch > '9') ch = getchar();
  while ('0' <= ch && ch <= '9') x = 10 * x + ch - '0', ch = getchar();
  return x;
}
struct edge {
  int x, l;
};
std::vector<edge> G[N + 5];
void adde(int u, int v, int l) {
  G[u].push_back((edge){v, l}), G[v].push_back((edge){u, l});
}
bool vis[N + 5];
int w[N + 5], n;
int hvy[N + 5], siz[N + 5];
int dfs1(int x, int fa) {
  siz[x] = 1;
  for (auto e : G[x])
    if (!vis[e.x] && e.x != fa) siz[x] += dfs1(e.x, x);
  return siz[x];
}
int dfs2(int x, int fa, int tot) {
  int ret = 0;
  hvy[x] = tot - siz[x];
  for (auto e : G[x])
    if (!vis[e.x] && e.x != fa) {
      int tmp = dfs2(e.x, x, tot);
      hvy[x] = std::max(hvy[x], siz[e.x]);
      if (!ret || hvy[tmp] < hvy[ret]) ret = tmp;
    }
  if (!ret || hvy[x] < hvy[ret]) ret = x;
  return ret;
}
int ans = 0;
double sum = 1E18;
double calc(int x, int fa, int l) {
  double ret = w[x] * sqrt(l) * l;
  for (auto e : G[x])
    if (e.x != fa) ret += calc(e.x, x, l + e.l);
  return ret;
}
double f[N + 5];
double dfs3(int x, int fa, int l) {
  f[x] = w[x] * sqrt(l);
  for (auto e : G[x])
    if (e.x != fa) f[x] += dfs3(e.x, x, l + e.l);
  return f[x];
}
void solve(int x) {
  double k = calc(x, 0, 0);
  if (k < sum) sum = k, ans = x;
  double val = 0;
  vis[x] = true;
  for (auto e : G[x])
    if (!vis[e.x]) val += dfs3(e.x, x, e.l);
  for (auto e : G[x])
    if (!vis[e.x])
      if (val - 2 * f[e.x] < 0) solve(dfs2(e.x, x, dfs1(e.x, x)));
}
int main() {
  n = read();
  for (int i = 1; i <= n; i++) w[i] = read();
  for (int i = 1, a, b, l; i < n; i++)
    a = read(), b = read(), l = read(), adde(a, b, l);
  solve(dfs2(1, 0, dfs1(1, 0)));
  printf("%d %.9f\n", ans, sum);
}
