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;
vector<int> v;
pair<long double, int> ans;
long double f[200010], g[200010], h[200010];
int n, hd[200001], cnt, w[200001], x, y, val, siz[200010];
struct node {
  int to, next, val;
} e[400001];
bool bo[400010];
void addedge(int x, int y, int val) {
  e[++cnt] = (node){y, hd[x], val}, hd[x] = cnt;
}
long double calc(long double x) { return x * sqrt(x); }
void getsiz(int x, int fa) {
  siz[x] = 1, v.push_back(x);
  for (int i = hd[x]; i; i = e[i].next)
    if (bo[e[i].to] && e[i].to != fa)
      getsiz(e[i].to, x), siz[x] += siz[e[i].to];
}
void dfs(int x, int fa, int df, int dg, int dh) {
  f[x] = calc(df) * w[x], g[x] = calc(dg) * w[x], h[x] = calc(dh) * w[x];
  for (int i = hd[x]; i; i = e[i].next)
    if (e[i].to != fa)
      dfs(e[i].to, x, df + e[i].val, dg + e[i].val, dh + e[i].val),
          f[x] += f[e[i].to], g[x] += g[e[i].to], h[x] += h[e[i].to];
}
long double getans(int x) {
  long double ans = 0;
  for (int i = hd[x]; i; i = e[i].next)
    dfs(e[i].to, x, e[i].val, e[i].val + 1, e[i].val - 1), ans += f[e[i].to];
  return ans;
}
pair<long double, int> solve(int x) {
  v.clear(), getsiz(x, 0);
  if (siz[x] == 1) return make_pair(getans(x), x);
  int mi = n + 1, mii, ma, nw;
  for (int i = 0; i < siz[x]; i++) {
    nw = v[i], ma = siz[x] - siz[nw];
    for (int j = hd[nw]; j; j = e[j].next)
      if (bo[e[j].to] && siz[e[j].to] < siz[nw] && siz[e[j].to] > ma)
        ma = siz[e[j].to];
    if (ma < mi) mi = ma, mii = nw;
  }
  bo[x = mii] = 0, mii = 0;
  long double ans = getans(x), Ans = w[x], Mi = ans;
  for (int i = hd[x]; i; i = e[i].next) Ans += g[e[i].to];
  for (int i = hd[x]; i; i = e[i].next)
    if (bo[e[i].to] && Ans - g[e[i].to] + h[e[i].to] < Mi)
      Mi = Ans - g[e[i].to] + h[e[i].to], mii = e[i].to;
  if (mii)
    return min(make_pair(ans, x), solve(mii));
  else
    return make_pair(ans, x);
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%d", &w[i]);
  for (int i = 1; i < n; i++) {
    scanf("%d%d%d", &x, &y, &val);
    addedge(x, y, val), addedge(y, x, val);
  }
  memset(bo, 1, sizeof(bo)), ans = solve(1);
  printf("%d %.10lf\n", ans.second, (double)ans.first);
  return 0;
}
