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 maxn = 2e5;
int n, w[maxn + 10], sz[maxn + 10];
int mnv, mnid;
bool vis[maxn + 10];
double nowa, ans = 1e100;
int pos;
struct edge {
  int to, len;
};
vector<edge> g[maxn + 10];
void dfssz(int p) {
  vis[p] = 1;
  sz[p] = 1;
  for (int i = 0; i < (int)g[p].size(); ++i) {
    edge e = g[p][i];
    if (!vis[e.to]) {
      dfssz(e.to);
      sz[p] += sz[e.to];
    }
  }
  vis[p] = 0;
}
void dfsrt(int p, int all) {
  vis[p] = 1;
  int now = all - sz[p];
  for (int i = 0; i < (int)g[p].size(); ++i) {
    edge e = g[p][i];
    if (!vis[e.to]) {
      dfsrt(e.to, all);
      now = max(now, sz[e.to]);
    }
  }
  if (now < mnv) {
    mnv = now;
    mnid = p;
  }
  vis[p] = 0;
}
double dfscalc(int p, int fa, int d) {
  double ans = w[p] * sqrt(d);
  nowa += w[p] * sqrt(d) * d;
  for (int i = 0; i < (int)g[p].size(); ++i) {
    edge e = g[p][i];
    if (e.to != fa) ans += dfscalc(e.to, p, d + e.len);
  }
  return ans;
}
void divide(int p) {
  dfssz(p);
  mnv = 1e9;
  dfsrt(p, sz[p]);
  p = mnid;
  vis[p] = 1;
  nowa = 0;
  double mxd = -1e100;
  int to = 0;
  for (int i = 0; i < (int)g[p].size(); ++i) {
    edge e = g[p][i];
    double v = dfscalc(e.to, p, e.len);
    if (!vis[e.to] && v > mxd) {
      mxd = v;
      to = e.to;
    }
  }
  if (nowa < ans) {
    ans = nowa;
    pos = p;
  }
  if (to) divide(to);
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; ++i) scanf("%d", &w[i]);
  for (int i = 1; i < n; ++i) {
    int l, r, w;
    scanf("%d%d%d", &l, &r, &w);
    g[l].push_back((edge){r, w});
    g[r].push_back((edge){l, w});
  }
  divide(1);
  printf("%d %.10lf", pos, ans);
}
